Theorem 2wlklem 16500

Description: Lemma for theorems for walks of length 2. (Contributed by Alexander van der Vekens, 1-Feb-2018.)

Assertion

Ref	Expression
2wlklem	|- ( A. k e. { 0 , 1 } ( E ` ( F ` k ) ) = { ( P ` k ) , ( P ` ( k + 1 ) ) } <-> ( ( E ` ( F ` 0 ) ) = { ( P ` 0 ) , ( P ` 1 ) } /\ ( E ` ( F ` 1 ) ) = { ( P ` 1 ) , ( P ` 2 ) } ) )

Distinct variable groups:   k, E   k, F   P, k

Proof of Theorem 2wlklem

Step	Hyp	Ref	Expression
1		c0ex 8284	. 2 |- 0 e. _V
2		1ex 8285	. 2 |- 1 e. _V
3		2fveq3 5680	. . 3 |- ( k = 0 -> ( E ` ( F ` k ) ) = ( E ` ( F ` 0 ) ) )
4		fveq2 5675	. . . 4 |- ( k = 0 -> ( P ` k ) = ( P ` 0 ) )
5		fv0p1e1 9372	. . . 4 |- ( k = 0 -> ( P ` ( k + 1 ) ) = ( P ` 1 ) )
6	4, 5	preq12d 3781	. . 3 |- ( k = 0 -> { ( P ` k ) , ( P ` ( k + 1 ) ) } = { ( P ` 0 ) , ( P ` 1 ) } )
7	3, 6	eqeq12d 2249	. 2 |- ( k = 0 -> ( ( E ` ( F ` k ) ) = { ( P ` k ) , ( P ` ( k + 1 ) ) } <-> ( E ` ( F ` 0 ) ) = { ( P ` 0 ) , ( P ` 1 ) } ) )
8		2fveq3 5680	. . 3 |- ( k = 1 -> ( E ` ( F ` k ) ) = ( E ` ( F ` 1 ) ) )
9		fveq2 5675	. . . 4 |- ( k = 1 -> ( P ` k ) = ( P ` 1 ) )
10		oveq1 6065	. . . . . 6 |- ( k = 1 -> ( k + 1 ) = ( 1 + 1 ) )
11		1p1e2 9374	. . . . . 6 |- ( 1 + 1 ) = 2
12	10, 11	eqtrdi 2283	. . . . 5 |- ( k = 1 -> ( k + 1 ) = 2 )
13	12	fveq2d 5679	. . . 4 |- ( k = 1 -> ( P ` ( k + 1 ) ) = ( P ` 2 ) )
14	9, 13	preq12d 3781	. . 3 |- ( k = 1 -> { ( P ` k ) , ( P ` ( k + 1 ) ) } = { ( P ` 1 ) , ( P ` 2 ) } )
15	8, 14	eqeq12d 2249	. 2 |- ( k = 1 -> ( ( E ` ( F ` k ) ) = { ( P ` k ) , ( P ` ( k + 1 ) ) } <-> ( E ` ( F ` 1 ) ) = { ( P ` 1 ) , ( P ` 2 ) } ) )
16	1, 2, 7, 15	ralpr 3749	1 |- ( A. k e. { 0 , 1 } ( E ` ( F ` k ) ) = { ( P ` k ) , ( P ` ( k + 1 ) ) } <-> ( ( E ` ( F ` 0 ) ) = { ( P ` 0 ) , ( P ` 1 ) } /\ ( E ` ( F ` 1 ) ) = { ( P ` 1 ) , ( P ` 2 ) } ) )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1398   A.wral 2522   {cpr 3695   ` cfv 5357  (class class class)co 6058   0cc0 8143   1c1 8144   + caddc 8146   2c2 9308

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216  ax-1cn 8236  ax-icn 8238  ax-addcl 8239  ax-mulcl 8241  ax-addcom 8243  ax-i2m1 8248  ax-0id 8251

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-iota 5317  df-fv 5365  df-ov 6061  df-2 9316

This theorem is referenced by:  upgr2wlkdc  16501