MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pm110.643 Unicode version

Theorem pm110.643 7819
Description: 1+1=2 for cardinal number addition, derived from pm54.43 7649 as promised. Theorem *110.643 of Principia Mathematica, vol. II, p. 86, which adds the remark, "The above proposition is occasionally useful." Whitehead and Russell define cardinal addition on collections of all sets equinumerous to 1 and 2 (which for us are proper classes unless we restrict them as in karden 7581), but after applying definitions, our theorem is equivalent. The comment for cdaval 7812 explains why we use  ~~ instead of =. See pm110.643ALT 7820 for a shorter proof that doesn't use pm54.43 7649. (Contributed by NM, 5-Apr-2007.) (Proof modification is discouraged.)
Assertion
Ref Expression
pm110.643  |-  ( 1o 
+c  1o )  ~~  2o

Proof of Theorem pm110.643
StepHypRef Expression
1 1on 6502 . . 3  |-  1o  e.  On
2 cdaval 7812 . . 3  |-  ( ( 1o  e.  On  /\  1o  e.  On )  -> 
( 1o  +c  1o )  =  ( ( 1o  X.  { (/) } )  u.  ( 1o  X.  { 1o } ) ) )
31, 1, 2mp2an 653 . 2  |-  ( 1o 
+c  1o )  =  ( ( 1o  X.  { (/) } )  u.  ( 1o  X.  { 1o } ) )
4 xp01disj 6511 . . 3  |-  ( ( 1o  X.  { (/) } )  i^i  ( 1o 
X.  { 1o }
) )  =  (/)
51elexi 2810 . . . . 5  |-  1o  e.  _V
6 0ex 4166 . . . . 5  |-  (/)  e.  _V
75, 6xpsnen 6962 . . . 4  |-  ( 1o 
X.  { (/) } ) 
~~  1o
85, 5xpsnen 6962 . . . 4  |-  ( 1o 
X.  { 1o }
)  ~~  1o
9 pm54.43 7649 . . . 4  |-  ( ( ( 1o  X.  { (/)
} )  ~~  1o  /\  ( 1o  X.  { 1o } )  ~~  1o )  ->  ( ( ( 1o  X.  { (/) } )  i^i  ( 1o 
X.  { 1o }
) )  =  (/)  <->  (
( 1o  X.  { (/)
} )  u.  ( 1o  X.  { 1o }
) )  ~~  2o ) )
107, 8, 9mp2an 653 . . 3  |-  ( ( ( 1o  X.  { (/)
} )  i^i  ( 1o  X.  { 1o }
) )  =  (/)  <->  (
( 1o  X.  { (/)
} )  u.  ( 1o  X.  { 1o }
) )  ~~  2o )
114, 10mpbi 199 . 2  |-  ( ( 1o  X.  { (/) } )  u.  ( 1o 
X.  { 1o }
) )  ~~  2o
123, 11eqbrtri 4058 1  |-  ( 1o 
+c  1o )  ~~  2o
Colors of variables: wff set class
Syntax hints:    <-> wb 176    = wceq 1632    e. wcel 1696    u. cun 3163    i^i cin 3164   (/)c0 3468   {csn 3653   class class class wbr 4039   Oncon0 4408    X. cxp 4703  (class class class)co 5874   1oc1o 6488   2oc2o 6489    ~~ cen 6876    +c ccda 7809
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-int 3879  df-br 4040  df-opab 4094  df-mpt 4095  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-1o 6495  df-2o 6496  df-er 6676  df-en 6880  df-dom 6881  df-sdom 6882  df-cda 7810
  Copyright terms: Public domain W3C validator