| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pltne | Structured version Visualization version GIF version | ||
| Description: The "less than" relation is not reflexive. (df-pss 3922 analog.) (Contributed by NM, 2-Dec-2011.) |
| Ref | Expression |
|---|---|
| pltne.s | ⊢ < = (lt‘𝐾) |
| Ref | Expression |
|---|---|
| pltne | ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐶) → (𝑋 < 𝑌 → 𝑋 ≠ 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2762 | . . . 4 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | pltne.s | . . . 4 ⊢ < = (lt‘𝐾) | |
| 3 | 1, 2 | pltval 18424 | . . 3 ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐶) → (𝑋 < 𝑌 ↔ (𝑋(le‘𝐾)𝑌 ∧ 𝑋 ≠ 𝑌))) |
| 4 | 3 | simplbda 505 | . 2 ⊢ (((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 < 𝑌) → 𝑋 ≠ 𝑌) |
| 5 | 4 | ex 418 | 1 ⊢ ((𝐾 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐶) → (𝑋 < 𝑌 → 𝑋 ≠ 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 class class class wbr 5107 ‘cfv 6537 lecple 17355 ltcplt 18402 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-plt 18422 |
| This theorem is used by: pltirr 18427 ogrpaddlt 20271 ornglmullt 21041 orngrmullt 21042 ofldchr 21795 isarchiofld 33647 atlen0 40191 1cvratex 40354 ps-2 40359 lhpn0 40885 |
| Copyright terms: Public domain | W3C validator |