Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > 2llnma1 | Structured version Visualization version GIF version |
Description: Two different intersecting lines (expressed in terms of atoms) meet at their common point (atom). (Contributed by NM, 11-Oct-2012.) |
Ref | Expression |
---|---|
2llnm.l | ⊢ ≤ = (le‘𝐾) |
2llnm.j | ⊢ ∨ = (join‘𝐾) |
2llnm.m | ⊢ ∧ = (meet‘𝐾) |
2llnm.a | ⊢ 𝐴 = (Atoms‘𝐾) |
Ref | Expression |
---|---|
2llnma1 | ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ((𝑄 ∨ 𝑃) ∧ (𝑄 ∨ 𝑅)) = 𝑄) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1132 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝐾 ∈ HL) | |
2 | simp21 1202 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑃 ∈ 𝐴) | |
3 | eqid 2824 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
4 | 2llnm.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | 3, 4 | atbase 36429 | . . 3 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
6 | 2, 5 | syl 17 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑃 ∈ (Base‘𝐾)) |
7 | simp22 1203 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑄 ∈ 𝐴) | |
8 | simp23 1204 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → 𝑅 ∈ 𝐴) | |
9 | simp3 1134 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) | |
10 | 2llnm.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
11 | 10, 4 | hlatjcom 36508 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃)) |
12 | 1, 2, 7, 11 | syl3anc 1367 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑃)) |
13 | 12 | breq2d 5081 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → (𝑅 ≤ (𝑃 ∨ 𝑄) ↔ 𝑅 ≤ (𝑄 ∨ 𝑃))) |
14 | 9, 13 | mtbid 326 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ¬ 𝑅 ≤ (𝑄 ∨ 𝑃)) |
15 | 2llnm.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
16 | 2llnm.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
17 | 3, 15, 10, 16, 4 | 2llnma1b 36926 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑄 ∨ 𝑃)) → ((𝑄 ∨ 𝑃) ∧ (𝑄 ∨ 𝑅)) = 𝑄) |
18 | 1, 6, 7, 8, 14, 17 | syl131anc 1379 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ((𝑄 ∨ 𝑃) ∧ (𝑄 ∨ 𝑅)) = 𝑄) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1083 = wceq 1536 ∈ wcel 2113 class class class wbr 5069 ‘cfv 6358 (class class class)co 7159 Basecbs 16486 lecple 16575 joincjn 17557 meetcmee 17558 Atomscatm 36403 HLchlt 36490 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-proset 17541 df-poset 17559 df-plt 17571 df-lub 17587 df-glb 17588 df-join 17589 df-meet 17590 df-p0 17652 df-lat 17659 df-clat 17721 df-oposet 36316 df-ol 36318 df-oml 36319 df-covers 36406 df-ats 36407 df-atl 36438 df-cvlat 36462 df-hlat 36491 |
This theorem is referenced by: 2llnma3r 36928 2llnma2 36929 cdleme17c 37428 |
Copyright terms: Public domain | W3C validator |