Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > inton | Structured version Visualization version GIF version |
Description: The intersection of the class of ordinal numbers is the empty set. (Contributed by NM, 20-Oct-2003.) |
Ref | Expression |
---|---|
inton | ⊢ ∩ On = ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0elon 6304 | . 2 ⊢ ∅ ∈ On | |
2 | int0el 4907 | . 2 ⊢ (∅ ∈ On → ∩ On = ∅) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ ∩ On = ∅ |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∈ wcel 2108 ∅c0 4253 ∩ cint 4876 Oncon0 6251 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-11 2156 ax-ext 2709 ax-nul 5225 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-int 4877 df-br 5071 df-tr 5188 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-ord 6254 df-on 6255 |
This theorem is referenced by: bday0s 33949 |
Copyright terms: Public domain | W3C validator |