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

Theorem wkslem1 16475
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 5690 . . 3  |-  ( A  =  B  ->  ( P `  A )  =  ( P `  B ) )
2 fvoveq1 6098 . . 3  |-  ( A  =  B  ->  ( P `  ( A  +  1 ) )  =  ( P `  ( B  +  1
) ) )
31, 2eqeq12d 2253 . 2  |-  ( A  =  B  ->  (
( P `  A
)  =  ( P `
 ( A  + 
1 ) )  <->  ( P `  B )  =  ( P `  ( B  +  1 ) ) ) )
4 2fveq3 5695 . . 3  |-  ( A  =  B  ->  (
I `  ( F `  A ) )  =  ( I `  ( F `  B )
) )
51sneqd 3718 . . 3  |-  ( A  =  B  ->  { ( P `  A ) }  =  { ( P `  B ) } )
64, 5eqeq12d 2253 . 2  |-  ( A  =  B  ->  (
( I `  ( F `  A )
)  =  { ( P `  A ) }  <->  ( I `  ( F `  B ) )  =  { ( P `  B ) } ) )
71, 2preq12d 3792 . . 3  |-  ( A  =  B  ->  { ( P `  A ) ,  ( P `  ( A  +  1
) ) }  =  { ( P `  B ) ,  ( P `  ( B  +  1 ) ) } )
87, 4sseq12d 3279 . 2  |-  ( A  =  B  ->  ( { ( P `  A ) ,  ( P `  ( A  +  1 ) ) }  C_  ( I `  ( F `  A
) )  <->  { ( P `  B ) ,  ( P `  ( B  +  1
) ) }  C_  ( I `  ( F `  B )
) ) )
93, 6, 8ifpbi123d 1005 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 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  df-ov 6078
This theorem is referenced by:  wlk1walkdom  16514  wlkres  16534
  Copyright terms: Public domain W3C validator