| 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 4247 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 18478 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ≤ 𝑋) |
| 5 | 4 | biantrurd 532 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ∧ 𝑌) ≠ 𝑋 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ (𝑋 ∧ 𝑌) ≠ 𝑋))) |
| 6 | 1, 2, 3 | latleeqm1 18481 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) = 𝑋)) |
| 7 | 6 | necon3bbid 2968 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) ≠ 𝑋)) |
| 8 | simp1 1136 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat) | |
| 9 | 1, 3 | latmcl 18454 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ∈ 𝐵) |
| 10 | simp2 1137 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 11 | latnlemlt.s | . . . 4 ⊢ < = (lt‘𝐾) | |
| 12 | 2, 11 | pltval 18346 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑋 ∧ 𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑋 ∧ 𝑌) < 𝑋 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ (𝑋 ∧ 𝑌) ≠ 𝑋))) |
| 13 | 8, 9, 10, 12 | syl3anc 1372 | . 2 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ∧ 𝑌) < 𝑋 ↔ ((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ (𝑋 ∧ 𝑌) ≠ 𝑋))) |
| 14 | 5, 7, 13 | 3bitr4d 311 | 1 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (¬ 𝑋 ≤ 𝑌 ↔ (𝑋 ∧ 𝑌) < 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ≠ wne 2931 class class class wbr 5123 ‘cfv 6541 (class class class)co 7413 Basecbs 17229 lecple 17280 ltcplt 18324 meetcmee 18328 Latclat 18445 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5259 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-id 5558 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-proset 18310 df-poset 18329 df-plt 18344 df-lub 18360 df-glb 18361 df-join 18362 df-meet 18363 df-lat 18446 |
| This theorem is referenced by: hlrelat2 39364 |
| Copyright terms: Public domain | W3C validator |