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

Theorem orddif 4334
Description: Ordinal derived from its successor. (Contributed by NM, 20-May-1998.)
Assertion
Ref Expression
orddif  |-  ( Ord 
A  ->  A  =  ( suc  A  \  { A } ) )

Proof of Theorem orddif
StepHypRef Expression
1 orddisj 4333 . 2  |-  ( Ord 
A  ->  ( A  i^i  { A } )  =  (/) )
2 disj3 3323 . . 3  |-  ( ( A  i^i  { A } )  =  (/)  <->  A  =  ( A  \  { A } ) )
3 df-suc 4170 . . . . . 6  |-  suc  A  =  ( A  u.  { A } )
43difeq1i 3103 . . . . 5  |-  ( suc 
A  \  { A } )  =  ( ( A  u.  { A } )  \  { A } )
5 difun2 3349 . . . . 5  |-  ( ( A  u.  { A } )  \  { A } )  =  ( A  \  { A } )
64, 5eqtri 2105 . . . 4  |-  ( suc 
A  \  { A } )  =  ( A  \  { A } )
76eqeq2i 2095 . . 3  |-  ( A  =  ( suc  A  \  { A } )  <-> 
A  =  ( A 
\  { A }
) )
82, 7bitr4i 185 . 2  |-  ( ( A  i^i  { A } )  =  (/)  <->  A  =  ( suc  A  \  { A } ) )
91, 8sylib 120 1  |-  ( Ord 
A  ->  A  =  ( suc  A  \  { A } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1287    \ cdif 2985    u. cun 2986    i^i cin 2987   (/)c0 3275   {csn 3430   Ord word 4161   suc csuc 4164
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-in1 577  ax-in2 578  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-setind 4324
This theorem depends on definitions:  df-bi 115  df-3an 924  df-tru 1290  df-fal 1293  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ne 2252  df-ral 2360  df-rab 2364  df-v 2617  df-dif 2990  df-un 2992  df-in 2994  df-ss 3001  df-nul 3276  df-sn 3436  df-suc 4170
This theorem is referenced by:  phplem3  6515  phplem4  6516  phplem4dom  6523  phplem4on  6528  dif1en  6540
  Copyright terms: Public domain W3C validator