Theorem wkslem2 16476

Description: Lemma 2 for walks to substitute the index of the condition for vertices and edges in a walk. (Contributed by AV, 23-Apr-2021.)

Assertion

Ref	Expression
wkslem2	|- ( ( A = B /\ ( A + 1 ) = C ) -> (if- ( ( P ` A ) = ( P ` ( A + 1 ) ) , ( I ` ( F ` A ) ) = { ( P ` A ) } , { ( P ` A ) , ( P ` ( A + 1 ) ) } C_ ( I ` ( F ` A ) ) ) <-> if- ( ( P ` B ) = ( P ` C ) , ( I ` ( F ` B ) ) = { ( P ` B ) } , { ( P ` B ) , ( P ` C ) } C_ ( I ` ( F ` B ) ) ) ) )

Proof of Theorem wkslem2

Step	Hyp	Ref	Expression
1		fveq2 5690	. . . 4 |- ( A = B -> ( P ` A ) = ( P ` B ) )
2	1	adantr 276	. . 3 |- ( ( A = B /\ ( A + 1 ) = C ) -> ( P ` A ) = ( P ` B ) )
3		fveq2 5690	. . . 4 |- ( ( A + 1 ) = C -> ( P ` ( A + 1 ) ) = ( P ` C ) )
4	3	adantl 277	. . 3 |- ( ( A = B /\ ( A + 1 ) = C ) -> ( P ` ( A + 1 ) ) = ( P ` C ) )
5	2, 4	eqeq12d 2253	. 2 |- ( ( A = B /\ ( A + 1 ) = C ) -> ( ( P ` A ) = ( P ` ( A + 1 ) ) <-> ( P ` B ) = ( P ` C ) ) )
6		2fveq3 5695	. . . 4 |- ( A = B -> ( I ` ( F ` A ) ) = ( I ` ( F ` B ) ) )
7	1	sneqd 3718	. . . 4 |- ( A = B -> { ( P ` A ) } = { ( P ` B ) } )
8	6, 7	eqeq12d 2253	. . 3 |- ( A = B -> ( ( I ` ( F ` A ) ) = { ( P ` A ) } <-> ( I ` ( F ` B ) ) = { ( P ` B ) } ) )
9	8	adantr 276	. 2 |- ( ( A = B /\ ( A + 1 ) = C ) -> ( ( I ` ( F ` A ) ) = { ( P ` A ) } <-> ( I ` ( F ` B ) ) = { ( P ` B ) } ) )
10	2, 4	preq12d 3792	. . 3 |- ( ( A = B /\ ( A + 1 ) = C ) -> { ( P ` A ) , ( P ` ( A + 1 ) ) } = { ( P ` B ) , ( P ` C ) } )
11	6	adantr 276	. . 3 |- ( ( A = B /\ ( A + 1 ) = C ) -> ( I ` ( F ` A ) ) = ( I ` ( F ` B ) ) )
12	10, 11	sseq12d 3279	. 2 |- ( ( A = B /\ ( A + 1 ) = C ) -> ( { ( P ` A ) , ( P ` ( A + 1 ) ) } C_ ( I ` ( F ` A ) ) <-> { ( P ` B ) , ( P ` C ) } C_ ( I ` ( F ` B ) ) ) )
13	5, 9, 12	ifpbi123d 1005	1 |- ( ( A = B /\ ( A + 1 ) = C ) -> (if- ( ( P ` A ) = ( P ` ( A + 1 ) ) , ( I ` ( F ` A ) ) = { ( P ` A ) } , { ( P ` A ) , ( P ` ( A + 1 ) ) } C_ ( I ` ( F ` A ) ) ) <-> if- ( ( P ` B ) = ( P ` C ) , ( I ` ( F ` B ) ) = { ( P ` B ) } , { ( P ` B ) , ( P ` C ) } C_ ( I ` ( F ` B ) ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  if-wif 990   = wceq 1402   C_ wss 3220   {csn 3705   {cpr 3706   ` cfv 5372  (class class class)co 6075   1c1 8170   + caddc 8172

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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-ifp 991  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-iota 5332  df-fv 5380

This theorem is referenced by:  wlkl1loop  16513  wlk1walkdom  16514