| 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 4051 analog.) (Contributed by NM, 7-Feb-2012.) |
| Ref | Expression |
|---|---|
| pltne.s | ⊢ < = (lt‘𝐾) |
| Ref | Expression |
|---|---|
| pltirr | ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ¬ 𝑋 < 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . 2 ⊢ 𝑋 = 𝑋 | |
| 2 | pltne.s | . . . . 5 ⊢ < = (lt‘𝐾) | |
| 3 | 2 | pltne 18486 | . . . 4 ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑋 < 𝑋 → 𝑋 ≠ 𝑋)) |
| 4 | 3 | 3anidm23 1448 | . . 3 ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝑋 < 𝑋 → 𝑋 ≠ 𝑋)) |
| 5 | 4 | necon2bd 2972 | . 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 2145 ≠ wne 2956 class class class wbr 5103 ‘cfv 6531 ltcplt 18462 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6487 df-fun 6533 df-fv 6539 df-plt 18482 |
| This theorem is used by: pospo 18497 atnlt 40338 llnnlt 40548 lplnnlt 40590 lvolnltN 40643 |
| Copyright terms: Public domain | W3C validator |