| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > orddisj | Structured version Visualization version GIF version | ||
| Description: An ordinal class and its singleton are disjoint. (Contributed by NM, 19-May-1998.) |
| Ref | Expression |
|---|---|
| orddisj | ⊢ (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordirr 6333 | . 2 ⊢ (Ord 𝐴 → ¬ 𝐴 ∈ 𝐴) | |
| 2 | disjsn 4666 | . 2 ⊢ ((𝐴 ∩ {𝐴}) = ∅ ↔ ¬ 𝐴 ∈ 𝐴) | |
| 3 | 1, 2 | sylibr 234 | 1 ⊢ (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1541 ∈ wcel 2113 ∩ cin 3898 ∅c0 4283 {csn 4578 Ord word 6314 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-br 5097 df-opab 5159 df-eprel 5522 df-fr 5575 df-we 5577 df-ord 6318 |
| This theorem is referenced by: orddif 6413 omsucne 7825 tfrlem10 8316 enrefnn 8981 pssnn 9091 unfi 9093 isinf 9163 dif1ennnALT 9175 ackbij1lem5 10131 ackbij1lem14 10140 ackbij1lem16 10142 unsnen 10461 pwfi2f1o 43280 |
| Copyright terms: Public domain | W3C validator |