| 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 8977 | . . . . 5 ⊢ (𝐴 ∈ On → 𝐴 ≈ 𝐴) | |
| 2 | 1 | adantr 485 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ≈ 𝐴) |
| 3 | simpr 489 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ∈ On) | |
| 4 | eqid 2769 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) | |
| 5 | 4 | oacomf1olem 8545 | . . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)) |
| 6 | 5 | ancoms 463 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)) |
| 7 | 6 | simpld 499 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) |
| 8 | f1oeng 8963 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) → 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) | |
| 9 | 3, 7, 8 | syl2anc 595 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) |
| 10 | incom 4170 | . . . . 5 ⊢ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) | |
| 11 | 6 | simprd 500 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅) |
| 12 | 10, 11 | eqtrid 2816 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = ∅) |
| 13 | djuenun 10150 | . . . 4 ⊢ ((𝐴 ≈ 𝐴 ∧ 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = ∅) → (𝐴 ⊔ 𝐵) ≈ (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) | |
| 14 | 2, 9, 12, 13 | syl3anc 1396 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊔ 𝐵) ≈ (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) |
| 15 | oarec 8543 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) | |
| 16 | 14, 15 | breqtrrd 5140 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊔ 𝐵) ≈ (𝐴 +o 𝐵)) |
| 17 | 16 | ensymd 8998 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ≈ (𝐴 ⊔ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∪ cun 3911 ∩ cin 3912 ∅c0 4294 class class class wbr 5110 ↦ cmpt 5193 ran crn 5660 Oncon0 6357 –1-1-onto→wf1o 6532 (class class class)co 7408 +o coa 8446 ≈ cen 8936 ⊔ cdju 9880 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-oadd 8453 df-er 8690 df-en 8940 df-dju 9883 |
| This theorem is referenced by: cardadju 10174 nnadjuALT 10178 tr3dom 44139 |
| Copyright terms: Public domain | W3C validator |