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

Theorem soeq2 4071
Description: Equality theorem for the strict ordering predicate. (Contributed by NM, 16-Mar-1997.)
Assertion
Ref Expression
soeq2  |-  ( A  =  B  ->  ( R  Or  A  <->  R  Or  B ) )

Proof of Theorem soeq2
StepHypRef Expression
1 soss 4069 . . . 4  |-  ( A 
C_  B  ->  ( R  Or  B  ->  R  Or  A ) )
2 soss 4069 . . . 4  |-  ( B 
C_  A  ->  ( R  Or  A  ->  R  Or  B ) )
31, 2anim12i 331 . . 3  |-  ( ( A  C_  B  /\  B  C_  A )  -> 
( ( R  Or  B  ->  R  Or  A
)  /\  ( R  Or  A  ->  R  Or  B ) ) )
4 eqss 3014 . . 3  |-  ( A  =  B  <->  ( A  C_  B  /\  B  C_  A ) )
5 dfbi2 380 . . 3  |-  ( ( R  Or  B  <->  R  Or  A )  <->  ( ( R  Or  B  ->  R  Or  A )  /\  ( R  Or  A  ->  R  Or  B ) ) )
63, 4, 53imtr4i 199 . 2  |-  ( A  =  B  ->  ( R  Or  B  <->  R  Or  A ) )
76bicomd 139 1  |-  ( A  =  B  ->  ( R  Or  A  <->  R  Or  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284    C_ wss 2973    Or wor 4050
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-in 2979  df-ss 2986  df-po 4051  df-iso 4052
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator