![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dju1p1e2 | Structured version Visualization version GIF version |
Description: 1+1=2 for cardinal number addition, derived from pm54.43 10070 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 9964), but after applying definitions, our theorem is equivalent. Because we use a disjoint union for cardinal addition (as explained in the comment at the top of this section), we use ≈ instead of =. See dju1p1e2ALT 10244 for a shorter proof that doesn't use pm54.43 10070. (Contributed by NM, 5-Apr-2007.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
dju1p1e2 | ⊢ (1o ⊔ 1o) ≈ 2o |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-dju 9970 | . 2 ⊢ (1o ⊔ 1o) = (({∅} × 1o) ∪ ({1o} × 1o)) | |
2 | xp01disjl 8548 | . . 3 ⊢ (({∅} × 1o) ∩ ({1o} × 1o)) = ∅ | |
3 | 0ex 5325 | . . . . 5 ⊢ ∅ ∈ V | |
4 | 1on 8534 | . . . . 5 ⊢ 1o ∈ On | |
5 | xpsnen2g 9131 | . . . . 5 ⊢ ((∅ ∈ V ∧ 1o ∈ On) → ({∅} × 1o) ≈ 1o) | |
6 | 3, 4, 5 | mp2an 691 | . . . 4 ⊢ ({∅} × 1o) ≈ 1o |
7 | xpsnen2g 9131 | . . . . 5 ⊢ ((1o ∈ On ∧ 1o ∈ On) → ({1o} × 1o) ≈ 1o) | |
8 | 4, 4, 7 | mp2an 691 | . . . 4 ⊢ ({1o} × 1o) ≈ 1o |
9 | pm54.43 10070 | . . . 4 ⊢ ((({∅} × 1o) ≈ 1o ∧ ({1o} × 1o) ≈ 1o) → ((({∅} × 1o) ∩ ({1o} × 1o)) = ∅ ↔ (({∅} × 1o) ∪ ({1o} × 1o)) ≈ 2o)) | |
10 | 6, 8, 9 | mp2an 691 | . . 3 ⊢ ((({∅} × 1o) ∩ ({1o} × 1o)) = ∅ ↔ (({∅} × 1o) ∪ ({1o} × 1o)) ≈ 2o) |
11 | 2, 10 | mpbi 230 | . 2 ⊢ (({∅} × 1o) ∪ ({1o} × 1o)) ≈ 2o |
12 | 1, 11 | eqbrtri 5187 | 1 ⊢ (1o ⊔ 1o) ≈ 2o |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ∪ cun 3974 ∩ cin 3975 ∅c0 4352 {csn 4648 class class class wbr 5166 × cxp 5698 Oncon0 6395 1oc1o 8515 2oc2o 8516 ≈ cen 9000 ⊔ cdju 9967 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-ord 6398 df-on 6399 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-1st 8030 df-2nd 8031 df-1o 8522 df-2o 8523 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-dju 9970 |
This theorem is referenced by: pr2dom 43489 |
Copyright terms: Public domain | W3C validator |