Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > on0eqel | Structured version Visualization version GIF version |
Description: An ordinal number either equals zero or contains zero. (Contributed by NM, 1-Jun-2004.) |
Ref | Expression |
---|---|
on0eqel | ⊢ (𝐴 ∈ On → (𝐴 = ∅ ∨ ∅ ∈ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0ss 4349 | . . 3 ⊢ ∅ ⊆ 𝐴 | |
2 | 0elon 6243 | . . . 4 ⊢ ∅ ∈ On | |
3 | onsseleq 6231 | . . . 4 ⊢ ((∅ ∈ On ∧ 𝐴 ∈ On) → (∅ ⊆ 𝐴 ↔ (∅ ∈ 𝐴 ∨ ∅ = 𝐴))) | |
4 | 2, 3 | mpan 688 | . . 3 ⊢ (𝐴 ∈ On → (∅ ⊆ 𝐴 ↔ (∅ ∈ 𝐴 ∨ ∅ = 𝐴))) |
5 | 1, 4 | mpbii 235 | . 2 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ∨ ∅ = 𝐴)) |
6 | eqcom 2828 | . . . 4 ⊢ (∅ = 𝐴 ↔ 𝐴 = ∅) | |
7 | 6 | orbi2i 909 | . . 3 ⊢ ((∅ ∈ 𝐴 ∨ ∅ = 𝐴) ↔ (∅ ∈ 𝐴 ∨ 𝐴 = ∅)) |
8 | orcom 866 | . . 3 ⊢ ((∅ ∈ 𝐴 ∨ 𝐴 = ∅) ↔ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)) | |
9 | 7, 8 | bitri 277 | . 2 ⊢ ((∅ ∈ 𝐴 ∨ ∅ = 𝐴) ↔ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)) |
10 | 5, 9 | sylib 220 | 1 ⊢ (𝐴 ∈ On → (𝐴 = ∅ ∨ ∅ ∈ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∨ wo 843 = wceq 1533 ∈ wcel 2110 ⊆ wss 3935 ∅c0 4290 Oncon0 6190 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pr 5329 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-tr 5172 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-ord 6193 df-on 6194 |
This theorem is referenced by: snsn0non 6308 onxpdisj 6309 omabs 8273 cnfcom3lem 9165 |
Copyright terms: Public domain | W3C validator |