let it1, it2 be preVNumberingSeq of G; :: thesis: ( ( for n being Nat holds it1 . n =(S . n)`1 ) & ( for n being Nat holds it2 . n =(S . n)`1 ) implies it1 = it2 ) assume that A1:
for n being Nat holds it1 . n =(S . n)`1and A2:
for n being Nat holds it2 . n =(S . n)`1
; :: thesis: it1 = it2