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. (Contributed by NM, 6-Dec-2004.) |
Ref | Expression |
---|---|
oa00 | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ ↔ (𝐴 = ∅ ∧ 𝐵 = ∅))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | on0eln0 6228 | . . . . . . 7 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
2 | 1 | adantr 484 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) |
3 | oaword1 8193 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ⊆ (𝐴 +o 𝐵)) | |
4 | 3 | sseld 3893 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 → ∅ ∈ (𝐴 +o 𝐵))) |
5 | 2, 4 | sylbird 263 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ≠ ∅ → ∅ ∈ (𝐴 +o 𝐵))) |
6 | ne0i 4235 | . . . . 5 ⊢ (∅ ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
7 | 5, 6 | syl6 35 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ≠ ∅ → (𝐴 +o 𝐵) ≠ ∅)) |
8 | 7 | necon4d 2975 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → 𝐴 = ∅)) |
9 | on0eln0 6228 | . . . . . . 7 ⊢ (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅)) | |
10 | 9 | adantl 485 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅)) |
11 | 0elon 6226 | . . . . . . . 8 ⊢ ∅ ∈ On | |
12 | oaord 8188 | . . . . . . . 8 ⊢ ((∅ ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) | |
13 | 11, 12 | mp3an1 1445 | . . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
14 | 13 | ancoms 462 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
15 | 10, 14 | bitr3d 284 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ≠ ∅ ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
16 | ne0i 4235 | . . . . 5 ⊢ ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
17 | 15, 16 | syl6bi 256 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ≠ ∅ → (𝐴 +o 𝐵) ≠ ∅)) |
18 | 17 | necon4d 2975 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → 𝐵 = ∅)) |
19 | 8, 18 | jcad 516 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → (𝐴 = ∅ ∧ 𝐵 = ∅))) |
20 | oveq12 7164 | . . 3 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 +o 𝐵) = (∅ +o ∅)) | |
21 | oa0 8156 | . . . 4 ⊢ (∅ ∈ On → (∅ +o ∅) = ∅) | |
22 | 11, 21 | ax-mp 5 | . . 3 ⊢ (∅ +o ∅) = ∅ |
23 | 20, 22 | eqtrdi 2809 | . 2 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 +o 𝐵) = ∅) |
24 | 19, 23 | impbid1 228 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ ↔ (𝐴 = ∅ ∧ 𝐵 = ∅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2951 ∅c0 4227 Oncon0 6173 (class class class)co 7155 +o coa 8114 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-rep 5159 ax-sep 5172 ax-nul 5179 ax-pr 5301 ax-un 7464 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-ral 3075 df-rex 3076 df-reu 3077 df-rab 3079 df-v 3411 df-sbc 3699 df-csb 3808 df-dif 3863 df-un 3865 df-in 3867 df-ss 3877 df-pss 3879 df-nul 4228 df-if 4424 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4802 df-iun 4888 df-br 5036 df-opab 5098 df-mpt 5116 df-tr 5142 df-id 5433 df-eprel 5438 df-po 5446 df-so 5447 df-fr 5486 df-we 5488 df-xp 5533 df-rel 5534 df-cnv 5535 df-co 5536 df-dm 5537 df-rn 5538 df-res 5539 df-ima 5540 df-pred 6130 df-ord 6176 df-on 6177 df-lim 6178 df-suc 6179 df-iota 6298 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7585 df-wrecs 7962 df-recs 8023 df-rdg 8061 df-oadd 8121 |
This theorem is referenced by: oalimcl 8201 oeoa 8238 |
Copyright terms: Public domain | W3C validator |