| 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 6388 | . . . . . . 7 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 2 | 1 | adantr 483 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) |
| 3 | oaword1 8505 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ⊆ (𝐴 +o 𝐵)) | |
| 4 | 3 | sseld 3926 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 → ∅ ∈ (𝐴 +o 𝐵))) |
| 5 | 2, 4 | sylbird 262 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ≠ ∅ → ∅ ∈ (𝐴 +o 𝐵))) |
| 6 | ne0i 4284 | . . . . 5 ⊢ (∅ ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
| 7 | 5, 6 | syl6 35 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ≠ ∅ → (𝐴 +o 𝐵) ≠ ∅)) |
| 8 | 7 | necon4d 2971 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → 𝐴 = ∅)) |
| 9 | on0eln0 6388 | . . . . . . 7 ⊢ (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅)) | |
| 10 | 9 | adantl 484 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅)) |
| 11 | 0elon 6386 | . . . . . . . 8 ⊢ ∅ ∈ On | |
| 12 | oaord 8500 | . . . . . . . 8 ⊢ ((∅ ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) | |
| 13 | 11, 12 | mp3an1 1459 | . . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
| 14 | 13 | ancoms 461 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
| 15 | 10, 14 | bitr3d 283 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ≠ ∅ ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
| 16 | ne0i 4284 | . . . . 5 ⊢ ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
| 17 | 15, 16 | biimtrdi 255 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ≠ ∅ → (𝐴 +o 𝐵) ≠ ∅)) |
| 18 | 17 | necon4d 2971 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → 𝐵 = ∅)) |
| 19 | 8, 18 | jcad 519 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| 20 | oveq12 7390 | . . 3 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 +o 𝐵) = (∅ +o ∅)) | |
| 21 | oa0 8469 | . . . 4 ⊢ (∅ ∈ On → (∅ +o ∅) = ∅) | |
| 22 | 11, 21 | ax-mp 5 | . . 3 ⊢ (∅ +o ∅) = ∅ |
| 23 | 20, 22 | eqtrdi 2803 | . 2 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 +o 𝐵) = ∅) |
| 24 | 19, 23 | impbid1 227 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ ↔ (𝐴 = ∅ ∧ 𝐵 = ∅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 ∅c0 4276 Oncon0 6331 (class class class)co 7381 +o coa 8418 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pr 5380 ax-un 7703 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-ral 3067 df-rex 3077 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-oadd 8425 |
| This theorem is referenced by: oalimcl 8513 oeoa 8551 |
| Copyright terms: Public domain | W3C validator |