ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  wkslem1 Unicode version

Theorem wkslem1 16170
Description: Lemma 1 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
wkslem1  |-  ( A  =  B  ->  (if- ( ( P `  A )  =  ( P `  ( A  +  1 ) ) ,  ( I `  ( F `  A ) )  =  { ( P `  A ) } ,  { ( P `  A ) ,  ( P `  ( A  +  1
) ) }  C_  ( I `  ( F `  A )
) )  <-> if- ( ( P `  B )  =  ( P `  ( B  +  1
) ) ,  ( I `  ( F `
 B ) )  =  { ( P `
 B ) } ,  { ( P `
 B ) ,  ( P `  ( B  +  1 ) ) }  C_  (
I `  ( F `  B ) ) ) ) )

Proof of Theorem wkslem1
StepHypRef Expression
1 fveq2 5639 . . 3  |-  ( A  =  B  ->  ( P `  A )  =  ( P `  B ) )
2 fvoveq1 6040 . . 3  |-  ( A  =  B  ->  ( P `  ( A  +  1 ) )  =  ( P `  ( B  +  1
) ) )
31, 2eqeq12d 2246 . 2  |-  ( A  =  B  ->  (
( P `  A
)  =  ( P `
 ( A  + 
1 ) )  <->  ( P `  B )  =  ( P `  ( B  +  1 ) ) ) )
4 2fveq3 5644 . . 3  |-  ( A  =  B  ->  (
I `  ( F `  A ) )  =  ( I `  ( F `  B )
) )
51sneqd 3682 . . 3  |-  ( A  =  B  ->  { ( P `  A ) }  =  { ( P `  B ) } )
64, 5eqeq12d 2246 . 2  |-  ( A  =  B  ->  (
( I `  ( F `  A )
)  =  { ( P `  A ) }  <->  ( I `  ( F `  B ) )  =  { ( P `  B ) } ) )
71, 2preq12d 3756 . . 3  |-  ( A  =  B  ->  { ( P `  A ) ,  ( P `  ( A  +  1
) ) }  =  { ( P `  B ) ,  ( P `  ( B  +  1 ) ) } )
87, 4sseq12d 3258 . 2  |-  ( A  =  B  ->  ( { ( P `  A ) ,  ( P `  ( A  +  1 ) ) }  C_  ( I `  ( F `  A
) )  <->  { ( P `  B ) ,  ( P `  ( B  +  1
) ) }  C_  ( I `  ( F `  B )
) ) )
93, 6, 8ifpbi123d 1000 1  |-  ( A  =  B  ->  (if- ( ( P `  A )  =  ( P `  ( A  +  1 ) ) ,  ( I `  ( F `  A ) )  =  { ( P `  A ) } ,  { ( P `  A ) ,  ( P `  ( A  +  1
) ) }  C_  ( I `  ( F `  A )
) )  <-> if- ( ( P `  B )  =  ( P `  ( B  +  1
) ) ,  ( I `  ( F `
 B ) )  =  { ( P `
 B ) } ,  { ( P `
 B ) ,  ( P `  ( B  +  1 ) ) }  C_  (
I `  ( F `  B ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105  if-wif 985    = wceq 1397    C_ wss 3200   {csn 3669   {cpr 3670   ` cfv 5326  (class class class)co 6017   1c1 8032    + caddc 8034
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-ifp 986  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020
This theorem is referenced by:  wlk1walkdom  16209  wlkres  16229
  Copyright terms: Public domain W3C validator