| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pltirr | Structured version Visualization version GIF version | ||
| Description: The "less than" relation is not reflexive. (pssirr 4060 analog.) (Contributed by NM, 7-Feb-2012.) |
| Ref | Expression |
|---|---|
| pltne.s | ⊢ < = (lt‘𝐾) |
| Ref | Expression |
|---|---|
| pltirr | ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ¬ 𝑋 < 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2766 | . 2 ⊢ 𝑋 = 𝑋 | |
| 2 | pltne.s | . . . . 5 ⊢ < = (lt‘𝐾) | |
| 3 | 2 | pltne 18413 | . . . 4 ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑋 < 𝑋 → 𝑋 ≠ 𝑋)) |
| 4 | 3 | 3anidm23 1448 | . . 3 ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝑋 < 𝑋 → 𝑋 ≠ 𝑋)) |
| 5 | 4 | necon2bd 2977 | . 2 ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝑋 = 𝑋 → ¬ 𝑋 < 𝑋)) |
| 6 | 1, 5 | mpi 21 | 1 ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ¬ 𝑋 < 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ≠ wne 2961 class class class wbr 5114 ‘cfv 6543 ltcplt 18389 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-iota 6499 df-fun 6545 df-fv 6551 df-plt 18409 |
| This theorem is used by: pospo 18424 atnlt 40128 llnnlt 40338 lplnnlt 40380 lvolnltN 40433 |
| Copyright terms: Public domain | W3C validator |