| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > oa00 | Structured version Visualization version GIF version | ||
| Description: An ordinal sum is zero iff both of its arguments are zero. Lemma 3.10 of [Schloeder] p. 8. (Contributed by NM, 6-Dec-2004.) |
| Ref | Expression |
|---|---|
| oa00 | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ ↔ (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | on0eln0 6372 | . . . . . . 7 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 2 | 1 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) |
| 3 | oaword1 8477 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ⊆ (𝐴 +o 𝐵)) | |
| 4 | 3 | sseld 3930 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 → ∅ ∈ (𝐴 +o 𝐵))) |
| 5 | 2, 4 | sylbird 260 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ≠ ∅ → ∅ ∈ (𝐴 +o 𝐵))) |
| 6 | ne0i 4291 | . . . . 5 ⊢ (∅ ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
| 7 | 5, 6 | syl6 35 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ≠ ∅ → (𝐴 +o 𝐵) ≠ ∅)) |
| 8 | 7 | necon4d 2954 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → 𝐴 = ∅)) |
| 9 | on0eln0 6372 | . . . . . . 7 ⊢ (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅)) | |
| 10 | 9 | adantl 481 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅)) |
| 11 | 0elon 6370 | . . . . . . . 8 ⊢ ∅ ∈ On | |
| 12 | oaord 8472 | . . . . . . . 8 ⊢ ((∅ ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) | |
| 13 | 11, 12 | mp3an1 1450 | . . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
| 14 | 13 | ancoms 458 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
| 15 | 10, 14 | bitr3d 281 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ≠ ∅ ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
| 16 | ne0i 4291 | . . . . 5 ⊢ ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
| 17 | 15, 16 | biimtrdi 253 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ≠ ∅ → (𝐴 +o 𝐵) ≠ ∅)) |
| 18 | 17 | necon4d 2954 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → 𝐵 = ∅)) |
| 19 | 8, 18 | jcad 512 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| 20 | oveq12 7365 | . . 3 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 +o 𝐵) = (∅ +o ∅)) | |
| 21 | oa0 8441 | . . . 4 ⊢ (∅ ∈ On → (∅ +o ∅) = ∅) | |
| 22 | 11, 21 | ax-mp 5 | . . 3 ⊢ (∅ +o ∅) = ∅ |
| 23 | 20, 22 | eqtrdi 2785 | . 2 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 +o 𝐵) = ∅) |
| 24 | 19, 23 | impbid1 225 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ ↔ (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∅c0 4283 Oncon0 6315 (class class class)co 7356 +o coa 8392 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-oadd 8399 |
| This theorem is referenced by: oalimcl 8485 oeoa 8523 |
| Copyright terms: Public domain | W3C validator |