| 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 8930 | . . 3 ⊢ (𝐴 ≺ 𝐴 → ¬ 𝐴 ≈ 𝐴) | |
| 2 | enrefg 8933 | . . 3 ⊢ (𝐴 ∈ V → 𝐴 ≈ 𝐴) | |
| 3 | 1, 2 | nsyl3 138 | . 2 ⊢ (𝐴 ∈ V → ¬ 𝐴 ≺ 𝐴) |
| 4 | relsdom 8902 | . . . 4 ⊢ Rel ≺ | |
| 5 | 4 | brrelex1i 5688 | . . 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 2114 Vcvv 3442 class class class wbr 5100 ≈ cen 8892 ≺ csdm 8894 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-en 8896 df-dom 8897 df-sdom 8898 |
| This theorem is referenced by: sdomn2lp 9056 2pwuninel 9072 2pwne 9073 r111 9699 alephval2 10495 alephom 10508 csdfil 23850 |
| Copyright terms: Public domain | W3C validator |