| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onadju | Structured version Visualization version GIF version | ||
| Description: The cardinal and ordinal sums are always equinumerous. (Contributed by Mario Carneiro, 6-Feb-2013.) (Revised by Jim Kingdon, 7-Sep-2023.) |
| Ref | Expression |
|---|---|
| onadju | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ≈ (𝐴 ⊔ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | enrefg 8931 | . . . . 5 ⊢ (𝐴 ∈ On → 𝐴 ≈ 𝐴) | |
| 2 | 1 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ≈ 𝐴) |
| 3 | simpr 484 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ∈ On) | |
| 4 | eqid 2736 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) | |
| 5 | 4 | oacomf1olem 8499 | . . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)) |
| 6 | 5 | ancoms 458 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)) |
| 7 | 6 | simpld 494 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) |
| 8 | f1oeng 8917 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) → 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) | |
| 9 | 3, 7, 8 | syl2anc 585 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) |
| 10 | incom 4149 | . . . . 5 ⊢ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) | |
| 11 | 6 | simprd 495 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅) |
| 12 | 10, 11 | eqtrid 2783 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = ∅) |
| 13 | djuenun 10093 | . . . 4 ⊢ ((𝐴 ≈ 𝐴 ∧ 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = ∅) → (𝐴 ⊔ 𝐵) ≈ (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) | |
| 14 | 2, 9, 12, 13 | syl3anc 1374 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊔ 𝐵) ≈ (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) |
| 15 | oarec 8497 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) | |
| 16 | 14, 15 | breqtrrd 5113 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊔ 𝐵) ≈ (𝐴 +o 𝐵)) |
| 17 | 16 | ensymd 8952 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ≈ (𝐴 ⊔ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∪ cun 3887 ∩ cin 3888 ∅c0 4273 class class class wbr 5085 ↦ cmpt 5166 ran crn 5632 Oncon0 6323 –1-1-onto→wf1o 6497 (class class class)co 7367 +o coa 8402 ≈ cen 8890 ⊔ cdju 9822 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-oadd 8409 df-er 8643 df-en 8894 df-dju 9825 |
| This theorem is referenced by: cardadju 10117 nnadjuALT 10121 tr3dom 43955 |
| Copyright terms: Public domain | W3C validator |