![]() |
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 39319 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 39852 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) ≤ 𝑍 ↔ (𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍))) |
7 | hllat 39345 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
8 | 7 | 3ad2ant1 1132 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝐾 ∈ Lat) |
9 | simp21 1205 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑋 ∈ 𝑁) | |
10 | eqid 2735 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
11 | 10, 5 | llnbase 39492 | . . . . 5 ⊢ (𝑋 ∈ 𝑁 → 𝑋 ∈ (Base‘𝐾)) |
12 | 9, 11 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑋 ∈ (Base‘𝐾)) |
13 | simp22 1206 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑌 ∈ 𝑁) | |
14 | 10, 5 | llnbase 39492 | . . . . 5 ⊢ (𝑌 ∈ 𝑁 → 𝑌 ∈ (Base‘𝐾)) |
15 | 13, 14 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → 𝑌 ∈ (Base‘𝐾)) |
16 | 10, 1, 3 | latmle2 18523 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾)) → (𝑋 ∧ 𝑌) ≤ 𝑌) |
17 | 8, 12, 15, 16 | syl3anc 1370 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → (𝑋 ∧ 𝑌) ≤ 𝑌) |
18 | breq1 5151 | . . 3 ⊢ ((𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍) → ((𝑋 ∧ 𝑌) ≤ 𝑌 ↔ (𝑋 ∧ 𝑍) ≤ 𝑌)) | |
19 | 17, 18 | syl5ibcom 245 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) = (𝑋 ∧ 𝑍) → (𝑋 ∧ 𝑍) ≤ 𝑌)) |
20 | 6, 19 | sylbid 240 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑍 ∈ 𝑁) ∧ ((𝑋 ∧ 𝑌) ∈ 𝐴 ∧ 𝑋 ≠ 𝑍)) → ((𝑋 ∧ 𝑌) ≤ 𝑍 → (𝑋 ∧ 𝑍) ≤ 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 class class class wbr 5148 ‘cfv 6563 (class class class)co 7431 Basecbs 17245 lecple 17305 joincjn 18369 meetcmee 18370 Latclat 18489 Atomscatm 39245 HLchlt 39332 LLinesclln 39474 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-1st 8013 df-2nd 8014 df-proset 18352 df-poset 18371 df-plt 18388 df-lub 18404 df-glb 18405 df-join 18406 df-meet 18407 df-p0 18483 df-lat 18490 df-clat 18557 df-oposet 39158 df-ol 39160 df-oml 39161 df-covers 39248 df-ats 39249 df-atl 39280 df-cvlat 39304 df-hlat 39333 df-llines 39481 df-psubsp 39486 df-pmap 39487 df-padd 39779 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |