Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > onacda | Structured version Visualization version GIF version |
Description: The cardinal and ordinal sums are always equinumerous. (Contributed by Mario Carneiro, 6-Feb-2013.) (Revised by Mario Carneiro, 30-May-2015.) |
Ref | Expression |
---|---|
onacda | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +𝑜 𝐵) ≈ (𝐴 +𝑐 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | enrefg 7873 | . . . . 5 ⊢ (𝐴 ∈ On → 𝐴 ≈ 𝐴) | |
2 | 1 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ≈ 𝐴) |
3 | simpr 476 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ∈ On) | |
4 | eqid 2610 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) | |
5 | 4 | oacomf1olem 7531 | . . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) ∩ 𝐴) = ∅)) |
6 | 5 | ancoms 468 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) ∩ 𝐴) = ∅)) |
7 | 6 | simpld 474 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥))) |
8 | f1oeng 7860 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥))) → 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥))) | |
9 | 3, 7, 8 | syl2anc 691 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥))) |
10 | incom 3767 | . . . . 5 ⊢ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥))) = (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) ∩ 𝐴) | |
11 | 6 | simprd 478 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) ∩ 𝐴) = ∅) |
12 | 10, 11 | syl5eq 2656 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥))) = ∅) |
13 | cdaenun 8879 | . . . 4 ⊢ ((𝐴 ≈ 𝐴 ∧ 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)) ∧ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥))) = ∅) → (𝐴 +𝑐 𝐵) ≈ (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)))) | |
14 | 2, 9, 12, 13 | syl3anc 1318 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +𝑐 𝐵) ≈ (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)))) |
15 | oarec 7529 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +𝑜 𝐵) = (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +𝑜 𝑥)))) | |
16 | 14, 15 | breqtrrd 4611 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +𝑐 𝐵) ≈ (𝐴 +𝑜 𝐵)) |
17 | 16 | ensymd 7893 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +𝑜 𝐵) ≈ (𝐴 +𝑐 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∪ cun 3538 ∩ cin 3539 ∅c0 3874 class class class wbr 4583 ↦ cmpt 4643 ran crn 5039 Oncon0 5640 –1-1-onto→wf1o 5803 (class class class)co 6549 +𝑜 coa 7444 ≈ cen 7838 +𝑐 ccda 8872 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-cda 8873 |
This theorem is referenced by: cardacda 8903 nnacda 8906 |
Copyright terms: Public domain | W3C validator |