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 6336 | . . . . . . 7 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
2 | 1 | adantr 482 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) |
3 | oaword1 8414 | . . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ⊆ (𝐴 +o 𝐵)) | |
4 | 3 | sseld 3925 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 → ∅ ∈ (𝐴 +o 𝐵))) |
5 | 2, 4 | sylbird 260 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ≠ ∅ → ∅ ∈ (𝐴 +o 𝐵))) |
6 | ne0i 4274 | . . . . 5 ⊢ (∅ ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
7 | 5, 6 | syl6 35 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ≠ ∅ → (𝐴 +o 𝐵) ≠ ∅)) |
8 | 7 | necon4d 2965 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → 𝐴 = ∅)) |
9 | on0eln0 6336 | . . . . . . 7 ⊢ (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅)) | |
10 | 9 | adantl 483 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅)) |
11 | 0elon 6334 | . . . . . . . 8 ⊢ ∅ ∈ On | |
12 | oaord 8409 | . . . . . . . 8 ⊢ ((∅ ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) | |
13 | 11, 12 | mp3an1 1448 | . . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
14 | 13 | ancoms 460 | . . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐵 ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
15 | 10, 14 | bitr3d 281 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ≠ ∅ ↔ (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) |
16 | ne0i 4274 | . . . . 5 ⊢ ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
17 | 15, 16 | syl6bi 253 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ≠ ∅ → (𝐴 +o 𝐵) ≠ ∅)) |
18 | 17 | necon4d 2965 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → 𝐵 = ∅)) |
19 | 8, 18 | jcad 514 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ → (𝐴 = ∅ ∧ 𝐵 = ∅))) |
20 | oveq12 7316 | . . 3 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 +o 𝐵) = (∅ +o ∅)) | |
21 | oa0 8377 | . . . 4 ⊢ (∅ ∈ On → (∅ +o ∅) = ∅) | |
22 | 11, 21 | ax-mp 5 | . . 3 ⊢ (∅ +o ∅) = ∅ |
23 | 20, 22 | eqtrdi 2792 | . 2 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 +o 𝐵) = ∅) |
24 | 19, 23 | impbid1 224 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) = ∅ ↔ (𝐴 = ∅ ∧ 𝐵 = ∅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1539 ∈ wcel 2104 ≠ wne 2941 ∅c0 4262 Oncon0 6281 (class class class)co 7307 +o coa 8325 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-rep 5218 ax-sep 5232 ax-nul 5239 ax-pr 5361 ax-un 7620 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3305 df-rab 3306 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-tr 5199 df-id 5500 df-eprel 5506 df-po 5514 df-so 5515 df-fr 5555 df-we 5557 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-pred 6217 df-ord 6284 df-on 6285 df-lim 6286 df-suc 6287 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-ov 7310 df-oprab 7311 df-mpo 7312 df-om 7745 df-2nd 7864 df-frecs 8128 df-wrecs 8159 df-recs 8233 df-rdg 8272 df-oadd 8332 |
This theorem is referenced by: oalimcl 8422 oeoa 8459 |
Copyright terms: Public domain | W3C validator |