HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem pm54.43 7115
Description: Theorem *54.43 of [WhiteheadRussell] p. 360. "From this proposition it will follow, when arithmetical addition has been defined, that 1+1=2." See http://en.wikipedia.org/wiki/Principia_Mathematica#Quotations. This theorem states that two sets of cardinality 1 are disjoint iff their union has cardinality 2.

Whitehead and Russell define 1 as the collection of all sets with cardinality 1 (i.e. all singletons; see card1 7083), so that their  A  e.  1 means, in our notation,  A  e.  { x  |  (
card `  x )  =  1o } which is the same as  A  ~~  1o by pm54.43lem 7114. We do not have several of their earlier lemmas available (which would otherwise be unused by our different approach to arithmetic), so our proof is longer. (It is also longer because we must show every detail.)

Theorem pm110.643 7266 shows the derivation of 1+1=2 for cardinal numbers from this theorem. (Contributed by NM, 4-Apr-2007.)

Assertion
Ref Expression
pm54.43  |-  ( ( A  ~~  1o  /\  B  ~~  1o )  -> 
( ( A  i^i  B )  =  (/)  <->  ( A  u.  B )  ~~  2o ) )

Proof of Theorem pm54.43
StepHypRef Expression
1 1on 5941 . . . . . . . 8  |-  1o  e.  On
21elexi 2484 . . . . . . 7  |-  1o  e.  _V
32ensn1 6362 . . . . . 6  |-  { 1o }  ~~  1o
43ensymi 6349 . . . . 5  |-  1o  ~~  { 1o }
5 entr 6350 . . . . 5  |-  ( ( B  ~~  1o  /\  1o  ~~  { 1o }
)  ->  B  ~~  { 1o } )
64, 5mpan2 645 . . . 4  |-  ( B 
~~  1o  ->  B  ~~  { 1o } )
71onirri 4048 . . . . . . 7  |-  -.  1o  e.  1o
8 disjsn 3308 . . . . . . 7  |-  ( ( 1o  i^i  { 1o } )  =  (/)  <->  -.  1o  e.  1o )
97, 8mpbir 198 . . . . . 6  |-  ( 1o 
i^i  { 1o } )  =  (/)
10 unen 6380 . . . . . 6  |-  ( ( ( A  ~~  1o  /\  B  ~~  { 1o } )  /\  (
( A  i^i  B
)  =  (/)  /\  ( 1o  i^i  { 1o }
)  =  (/) ) )  ->  ( A  u.  B )  ~~  ( 1o  u.  { 1o }
) )
119, 10mpanr2 658 . . . . 5  |-  ( ( ( A  ~~  1o  /\  B  ~~  { 1o } )  /\  ( A  i^i  B )  =  (/) )  ->  ( A  u.  B )  ~~  ( 1o  u.  { 1o } ) )
1211ex 420 . . . 4  |-  ( ( A  ~~  1o  /\  B  ~~  { 1o }
)  ->  ( ( A  i^i  B )  =  (/)  ->  ( A  u.  B )  ~~  ( 1o  u.  { 1o }
) ) )
136, 12sylan2 454 . . 3  |-  ( ( A  ~~  1o  /\  B  ~~  1o )  -> 
( ( A  i^i  B )  =  (/)  ->  ( A  u.  B )  ~~  ( 1o  u.  { 1o } ) ) )
14 df-2o 5935 . . . . 5  |-  2o  =  suc  1o
15 df-suc 3949 . . . . 5  |-  suc  1o  =  ( 1o  u.  { 1o } )
1614, 15eqtri 2084 . . . 4  |-  2o  =  ( 1o  u.  { 1o } )
1716breq2i 3594 . . 3  |-  ( ( A  u.  B ) 
~~  2o  <->  ( A  u.  B )  ~~  ( 1o  u.  { 1o }
) )
1813, 17syl6ibr 216 . 2  |-  ( ( A  ~~  1o  /\  B  ~~  1o )  -> 
( ( A  i^i  B )  =  (/)  ->  ( A  u.  B )  ~~  2o ) )
19 en1 6365 . . 3  |-  ( A 
~~  1o  <->  E. x  A  =  { x } )
20 en1 6365 . . 3  |-  ( B 
~~  1o  <->  E. y  B  =  { y } )
21 unidm 2940 . . . . . . . . . . . . . 14  |-  ( { x }  u.  {
x } )  =  { x }
22 sneq 3266 . . . . . . . . . . . . . . 15  |-  ( x  =  y  ->  { x }  =  { y } )
2322uneq2d 2951 . . . . . . . . . . . . . 14  |-  ( x  =  y  ->  ( { x }  u.  { x } )  =  ( { x }  u.  { y } ) )
2421, 23syl5reqr 2111 . . . . . . . . . . . . 13  |-  ( x  =  y  ->  ( { x }  u.  { y } )  =  { x } )
25 vex 2478 . . . . . . . . . . . . . . 15  |-  x  e. 
_V
2625ensn1 6362 . . . . . . . . . . . . . 14  |-  { x }  ~~  1o
27 1sdom2 6545 . . . . . . . . . . . . . 14  |-  1o  ~<  2o
28 ensdomtr 6434 . . . . . . . . . . . . . 14  |-  ( ( { x }  ~~  1o  /\  1o  ~<  2o )  ->  { x }  ~<  2o )
2926, 27, 28mp2an 646 . . . . . . . . . . . . 13  |-  { x }  ~<  2o
3024, 29syl6eqbr 3623 . . . . . . . . . . . 12  |-  ( x  =  y  ->  ( { x }  u.  { y } )  ~<  2o )
31 sdomnen 6328 . . . . . . . . . . . 12  |-  ( ( { x }  u.  { y } )  ~<  2o  ->  -.  ( {
x }  u.  {
y } )  ~~  2o )
3230, 31syl 15 . . . . . . . . . . 11  |-  ( x  =  y  ->  -.  ( { x }  u.  { y } )  ~~  2o )
3332necon2ai 2226 . . . . . . . . . 10  |-  ( ( { x }  u.  { y } )  ~~  2o  ->  x  =/=  y
)
34 disjsn2 3309 . . . . . . . . . 10  |-  ( x  =/=  y  ->  ( { x }  i^i  { y } )  =  (/) )
3533, 34syl 15 . . . . . . . . 9  |-  ( ( { x }  u.  { y } )  ~~  2o  ->  ( { x }  i^i  { y } )  =  (/) )
3635a1i 10 . . . . . . . 8  |-  ( ( A  =  { x }  /\  B  =  {
y } )  -> 
( ( { x }  u.  { y } )  ~~  2o  ->  ( { x }  i^i  { y } )  =  (/) ) )
37 uneq12 2946 . . . . . . . . 9  |-  ( ( A  =  { x }  /\  B  =  {
y } )  -> 
( A  u.  B
)  =  ( { x }  u.  {
y } ) )
3837breq1d 3596 . . . . . . . 8  |-  ( ( A  =  { x }  /\  B  =  {
y } )  -> 
( ( A  u.  B )  ~~  2o  <->  ( { x }  u.  { y } )  ~~  2o ) )
39 ineq12 2985 . . . . . . . . 9  |-  ( ( A  =  { x }  /\  B  =  {
y } )  -> 
( A  i^i  B
)  =  ( { x }  i^i  {
y } ) )
4039eqeq1d 2072 . . . . . . . 8  |-  ( ( A  =  { x }  /\  B  =  {
y } )  -> 
( ( A  i^i  B )  =  (/)  <->  ( {
x }  i^i  {
y } )  =  (/) ) )
4136, 38, 403imtr4d 257 . . . . . . 7  |-  ( ( A  =  { x }  /\  B  =  {
y } )  -> 
( ( A  u.  B )  ~~  2o  ->  ( A  i^i  B
)  =  (/) ) )
4241ex 420 . . . . . 6  |-  ( A  =  { x }  ->  ( B  =  {
y }  ->  (
( A  u.  B
)  ~~  2o  ->  ( A  i^i  B )  =  (/) ) ) )
4342exlimdv 1781 . . . . 5  |-  ( A  =  { x }  ->  ( E. y  B  =  { y }  ->  ( ( A  u.  B )  ~~  2o  ->  ( A  i^i  B )  =  (/) ) ) )
4443exlimiv 1867 . . . 4  |-  ( E. x  A  =  {
x }  ->  ( E. y  B  =  { y }  ->  ( ( A  u.  B
)  ~~  2o  ->  ( A  i^i  B )  =  (/) ) ) )
4544imp 415 . . 3  |-  ( ( E. x  A  =  { x }  /\  E. y  B  =  {
y } )  -> 
( ( A  u.  B )  ~~  2o  ->  ( A  i^i  B
)  =  (/) ) )
4619, 20, 45syl2anb 459 . 2  |-  ( ( A  ~~  1o  /\  B  ~~  1o )  -> 
( ( A  u.  B )  ~~  2o  ->  ( A  i^i  B
)  =  (/) ) )
4718, 46impbid 181 1  |-  ( ( A  ~~  1o  /\  B  ~~  1o )  -> 
( ( A  i^i  B )  =  (/)  <->  ( A  u.  B )  ~~  2o ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 174    /\ wa 356   E.wex 1446    = wceq 1520    e. wcel 1522    =/= wne 2182    u. cun 2791    i^i cin 2792   (/)c0 3072   {csn 3255   class class class wbr 3586   Oncon0 3943   suc csuc 3945   1oc1o 5927   2oc2o 5928    ~~ cen 6298    ~< csdm 6300
This theorem is referenced by:  pr2nelem  7116  pm110.643  7266  isprm2lem  11870
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-5 1442  ax-6 1443  ax-7 1444  ax-gen 1445  ax-8 1524  ax-11 1525  ax-13 1526  ax-14 1527  ax-17 1529  ax-12o 1562  ax-10 1576  ax-9 1582  ax-4 1589  ax-16 1775  ax-ext 2046  ax-sep 3701  ax-nul 3709  ax-pow 3745  ax-pr 3769  ax-un 4061
This theorem depends on definitions:  df-bi 175  df-or 357  df-an 358  df-3or 897  df-3an 898  df-tru 1259  df-ex 1447  df-sb 1736  df-eu 1958  df-mo 1959  df-clab 2052  df-cleq 2057  df-clel 2060  df-ne 2184  df-ral 2278  df-rex 2279  df-reu 2280  df-rab 2281  df-v 2477  df-sbc 2651  df-dif 2796  df-un 2798  df-in 2800  df-ss 2804  df-pss 2806  df-nul 3073  df-if 3182  df-pw 3243  df-sn 3261  df-pr 3262  df-tp 3263  df-op 3264  df-uni 3425  df-br 3587  df-opab 3641  df-tr 3674  df-eprel 3856  df-id 3860  df-po 3865  df-so 3866  df-fr 3903  df-we 3905  df-ord 3946  df-on 3947  df-lim 3948  df-suc 3949  df-om 4224  df-xp 4270  df-rel 4271  df-cnv 4272  df-co 4273  df-dm 4274  df-rn 4275  df-res 4276  df-ima 4277  df-fun 4278  df-fn 4279  df-f 4280  df-f1 4281  df-fo 4282  df-f1o 4283  df-fv 4284  df-1o 5934  df-2o 5935  df-er 6115  df-en 6302  df-dom 6303  df-sdom 6304
Copyright terms: Public domain