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

Theorem soeq2 4419
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 4417 . . . 4  |-  ( A 
C_  B  ->  ( R  Or  B  ->  R  Or  A ) )
2 soss 4417 . . . 4  |-  ( B 
C_  A  ->  ( R  Or  A  ->  R  Or  B ) )
31, 2anim12i 338 . . 3  |-  ( ( A  C_  B  /\  B  C_  A )  -> 
( ( R  Or  B  ->  R  Or  A
)  /\  ( R  Or  A  ->  R  Or  B ) ) )
4 eqss 3243 . . 3  |-  ( A  =  B  <->  ( A  C_  B  /\  B  C_  A ) )
5 dfbi2 388 . . 3  |-  ( ( R  Or  B  <->  R  Or  A )  <->  ( ( R  Or  B  ->  R  Or  A )  /\  ( R  Or  A  ->  R  Or  B ) ) )
63, 4, 53imtr4i 201 . 2  |-  ( A  =  B  ->  ( R  Or  B  <->  R  Or  A ) )
76bicomd 141 1  |-  ( A  =  B  ->  ( R  Or  A  <->  R  Or  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    C_ wss 3201    Or wor 4398
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 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-in 3207  df-ss 3214  df-po 4399  df-iso 4400
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator