| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sdomirr | Structured version Visualization version GIF version | ||
| Description: Strict dominance is irreflexive. Theorem 21(i) of [Suppes] p. 97. (Contributed by NM, 4-Jun-1998.) |
| Ref | Expression |
|---|---|
| sdomirr | ⊢ ¬ 𝐴 ≺ 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sdomnen 8918 | . . 3 ⊢ (𝐴 ≺ 𝐴 → ¬ 𝐴 ≈ 𝐴) | |
| 2 | enrefg 8921 | . . 3 ⊢ (𝐴 ∈ V → 𝐴 ≈ 𝐴) | |
| 3 | 1, 2 | nsyl3 138 | . 2 ⊢ (𝐴 ∈ V → ¬ 𝐴 ≺ 𝐴) |
| 4 | relsdom 8890 | . . . 4 ⊢ Rel ≺ | |
| 5 | 4 | brrelex1i 5680 | . . 3 ⊢ (𝐴 ≺ 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | con3i 154 | . 2 ⊢ (¬ 𝐴 ∈ V → ¬ 𝐴 ≺ 𝐴) |
| 7 | 3, 6 | pm2.61i 182 | 1 ⊢ ¬ 𝐴 ≺ 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∈ wcel 2113 Vcvv 3440 class class class wbr 5098 ≈ cen 8880 ≺ csdm 8882 |
| 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 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| 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 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-en 8884 df-dom 8885 df-sdom 8886 |
| This theorem is referenced by: sdomn2lp 9044 2pwuninel 9060 2pwne 9061 r111 9687 alephval2 10483 alephom 10496 csdfil 23838 |
| Copyright terms: Public domain | W3C validator |