| 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 9011 | . . . . 5 ⊢ (𝐴 ∈ On → 𝐴 ≈ 𝐴) | |
| 2 | 1 | adantr 486 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ≈ 𝐴) |
| 3 | simpr 490 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ∈ On) | |
| 4 | eqid 2761 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) | |
| 5 | 4 | oacomf1olem 8572 | . . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)) |
| 6 | 5 | ancoms 464 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)) |
| 7 | 6 | simpld 500 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) |
| 8 | f1oeng 8997 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)):𝐵–1-1-onto→ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) → 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) | |
| 9 | 3, 7, 8 | syl2anc 596 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) |
| 10 | incom 4155 | . . . . 5 ⊢ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) | |
| 11 | 6 | simprd 501 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅) |
| 12 | 10, 11 | eqtrid 2808 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = ∅) |
| 13 | djuenun 10249 | . . . 4 ⊢ ((𝐴 ≈ 𝐴 ∧ 𝐵 ≈ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)) ∧ (𝐴 ∩ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))) = ∅) → (𝐴 ⊔ 𝐵) ≈ (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) | |
| 14 | 2, 9, 12, 13 | syl3anc 1398 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊔ 𝐵) ≈ (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) |
| 15 | oarec 8570 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 ∪ ran (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥)))) | |
| 16 | 14, 15 | breqtrrd 5133 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊔ 𝐵) ≈ (𝐴 +o 𝐵)) |
| 17 | 16 | ensymd 9032 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ≈ (𝐴 ⊔ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∪ cun 3897 ∩ cin 3898 ∅c0 4279 class class class wbr 5103 ↦ cmpt 5186 ran crn 5652 Oncon0 6362 –1-1-onto→wf1o 6537 (class class class)co 7420 +o coa 8473 ≈ cen 8970 ⊔ cdju 9979 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-oadd 8480 df-er 8717 df-en 8974 df-dju 9982 |
| This theorem is used by: cardadju 10273 nnadjuALT 10277 tr3dom 44528 |
| Copyright terms: Public domain | W3C validator |