![]() |
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 37799 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 38332 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) ≤ 𝑍 ↔ (𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍))) |
7 | hllat 37825 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
8 | 7 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝐾 ∈ Lat) |
9 | simp21 1206 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑋 ∈ 𝑁) | |
10 | eqid 2736 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
11 | 10, 5 | llnbase 37972 | . . . . 5 ⊢ (𝑋 ∈ 𝑁 → 𝑋 ∈ (Base‘𝐾)) |
12 | 9, 11 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑋 ∈ (Base‘𝐾)) |
13 | simp22 1207 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑌 ∈ 𝑁) | |
14 | 10, 5 | llnbase 37972 | . . . . 5 ⊢ (𝑌 ∈ 𝑁 → 𝑌 ∈ (Base‘𝐾)) |
15 | 13, 14 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑌 ∈ (Base‘𝐾)) |
16 | 10, 1, 3 | latmle2 18354 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾)) → (𝑋 ∧ 𝑌) ≤ 𝑌) |
17 | 8, 12, 15, 16 | syl3anc 1371 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → (𝑋 ∧ 𝑌) ≤ 𝑌) |
18 | breq1 5108 | . . 3 ⊢ ((𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍) → ((𝑋 ∧ 𝑌) ≤ 𝑌 ↔ (𝑋 ∧ 𝑍) ≤ 𝑌)) | |
19 | 17, 18 | syl5ibcom 244 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍) → (𝑋 ∧ 𝑍) ≤ 𝑌)) |
20 | 6, 19 | sylbid 239 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) ≤ 𝑍 → (𝑋 ∧ 𝑍) ≤ 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 class class class wbr 5105 ‘cfv 6496 (class class class)co 7357 Basecbs 17083 lecple 17140 joincjn 18200 meetcmee 18201 Latclat 18320 Atomscatm 37725 HLchlt 37812 LLinesclln 37954 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-iin 4957 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-1st 7921 df-2nd 7922 df-proset 18184 df-poset 18202 df-plt 18219 df-lub 18235 df-glb 18236 df-join 18237 df-meet 18238 df-p0 18314 df-lat 18321 df-clat 18388 df-oposet 37638 df-ol 37640 df-oml 37641 df-covers 37728 df-ats 37729 df-atl 37760 df-cvlat 37784 df-hlat 37813 df-llines 37961 df-psubsp 37966 df-pmap 37967 df-padd 38259 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |