Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > llnexch2N | Structured version Visualization version GIF version |
Description: Line exchange property (compare cvlatexch2 37007 for atoms). (Contributed by NM, 18-Nov-2012.) (New usage is discouraged.) |
Ref | Expression |
---|---|
llnexch.l | ⊢ ≤ = (le‘𝐾) |
llnexch.j | ⊢ ∨ = (join‘𝐾) |
llnexch.m | ⊢ ∧ = (meet‘𝐾) |
llnexch.a | ⊢ 𝐴 = (Atoms‘𝐾) |
llnexch.n | ⊢ 𝑁 = (LLines‘𝐾) |
Ref | Expression |
---|---|
llnexch2N | ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) ≤ 𝑍 → (𝑋 ∧ 𝑍) ≤ 𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | llnexch.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
2 | llnexch.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
3 | llnexch.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
4 | llnexch.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | llnexch.n | . . 3 ⊢ 𝑁 = (LLines‘𝐾) | |
6 | 1, 2, 3, 4, 5 | llnexchb2 37539 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) ≤ 𝑍 ↔ (𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍))) |
7 | hllat 37033 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
8 | 7 | 3ad2ant1 1134 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝐾 ∈ Lat) |
9 | simp21 1207 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑋 ∈ 𝑁) | |
10 | eqid 2739 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
11 | 10, 5 | llnbase 37179 | . . . . 5 ⊢ (𝑋 ∈ 𝑁 → 𝑋 ∈ (Base‘𝐾)) |
12 | 9, 11 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑋 ∈ (Base‘𝐾)) |
13 | simp22 1208 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑌 ∈ 𝑁) | |
14 | 10, 5 | llnbase 37179 | . . . . 5 ⊢ (𝑌 ∈ 𝑁 → 𝑌 ∈ (Base‘𝐾)) |
15 | 13, 14 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑌 ∈ (Base‘𝐾)) |
16 | 10, 1, 3 | latmle2 17816 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾)) → (𝑋 ∧ 𝑌) ≤ 𝑌) |
17 | 8, 12, 15, 16 | syl3anc 1372 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → (𝑋 ∧ 𝑌) ≤ 𝑌) |
18 | breq1 5043 | . . 3 ⊢ ((𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍) → ((𝑋 ∧ 𝑌) ≤ 𝑌 ↔ (𝑋 ∧ 𝑍) ≤ 𝑌)) | |
19 | 17, 18 | syl5ibcom 248 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍) → (𝑋 ∧ 𝑍) ≤ 𝑌)) |
20 | 6, 19 | sylbid 243 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) ≤ 𝑍 → (𝑋 ∧ 𝑍) ≤ 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1088 = wceq 1542 ∈ wcel 2114 ≠ wne 2935 class class class wbr 5040 ‘cfv 6350 (class class class)co 7183 Basecbs 16599 lecple 16688 joincjn 17683 meetcmee 17684 Latclat 17784 Atomscatm 36933 HLchlt 37020 LLinesclln 37161 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2711 ax-rep 5164 ax-sep 5177 ax-nul 5184 ax-pow 5242 ax-pr 5306 ax-un 7492 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2541 df-eu 2571 df-clab 2718 df-cleq 2731 df-clel 2812 df-nfc 2882 df-ne 2936 df-ral 3059 df-rex 3060 df-reu 3061 df-rab 3063 df-v 3402 df-sbc 3686 df-csb 3801 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4222 df-if 4425 df-pw 4500 df-sn 4527 df-pr 4529 df-op 4533 df-uni 4807 df-iun 4893 df-iin 4894 df-br 5041 df-opab 5103 df-mpt 5121 df-id 5439 df-xp 5541 df-rel 5542 df-cnv 5543 df-co 5544 df-dm 5545 df-rn 5546 df-res 5547 df-ima 5548 df-iota 6308 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7140 df-ov 7186 df-oprab 7187 df-mpo 7188 df-1st 7727 df-2nd 7728 df-proset 17667 df-poset 17685 df-plt 17697 df-lub 17713 df-glb 17714 df-join 17715 df-meet 17716 df-p0 17778 df-lat 17785 df-clat 17847 df-oposet 36846 df-ol 36848 df-oml 36849 df-covers 36936 df-ats 36937 df-atl 36968 df-cvlat 36992 df-hlat 37021 df-llines 37168 df-psubsp 37173 df-pmap 37174 df-padd 37466 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |