| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > latnlemlt | Structured version Visualization version GIF version | ||
| Description: Negation of "less than or equal to" expressed in terms of meet and less-than. (nssinpss 4212 analog.) (Contributed by NM, 5-Feb-2012.) |
| Ref | Expression |
|---|---|
| latnlemlt.b | ⊢ 𝐵 = (Base‘𝐾) |
| latnlemlt.l | ⊢ ≤ = (le‘𝐾) |
| latnlemlt.s | ⊢ < = (lt‘𝐾) |
| latnlemlt.m | ⊢ ∧ = (meet‘𝐾) |
| Ref | Expression |
|---|---|
| latnlemlt | ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) < 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | latnlemlt.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | latnlemlt.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 3 | latnlemlt.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 4 | 1, 2, 3 | latmle1 18599 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ≤ 𝑋) |
| 5 | 4 | biantrurd 542 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ∧ 𝑌) ≠ 𝑋 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ (𝑋 ∧ 𝑌) ≠ 𝑋))) |
| 6 | 1, 2, 3 | latleeqm1 18602 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| 7 | 6 | necon3bbid 2992 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) ≠ 𝑋)) |
| 8 | simp1 1154 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) | |
| 9 | 1, 3 | latmcl 18575 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ∈ 𝐵) |
| 10 | simp2 1155 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 11 | latnlemlt.s | . . . 4 ⊢ < = (lt‘𝐾) | |
| 12 | 2, 11 | pltval 18465 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∧ 𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑋 ∧ 𝑌) < 𝑋 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ (𝑋 ∧ 𝑌) ≠ 𝑋))) |
| 13 | 8, 9, 10, 12 | syl3anc 1398 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ∧ 𝑌) < 𝑋 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ (𝑋 ∧ 𝑌) ≠ 𝑋))) |
| 14 | 5, 7, 13 | 3bitr4d 314 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) < 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 class class class wbr 5102 ‘cfv 6527 (class class class)co 7408 Basecbs 17348 lecple 17396 ltcplt 18443 meetcmee 18447 Latclat 18566 |
| 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 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-proset 18429 df-poset 18448 df-plt 18463 df-lub 18479 df-glb 18480 df-join 18481 df-meet 18482 df-lat 18567 |
| This theorem is used by: hlrelat2 40380 |
| Copyright terms: Public domain | W3C validator |