| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lplnllnneN | Structured version Visualization version GIF version | ||
| Description: Two lattice lines defined by atoms defining a lattice plane are not equal. (Contributed by NM, 9-Oct-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| lplnri1.j | ⊢ ∨ = (join‘𝐾) |
| lplnri1.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| lplnri1.p | ⊢ 𝑃 = (LPlanes‘𝐾) |
| lplnri1.y | ⊢ 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑆) |
| Ref | Expression |
|---|---|
| lplnllnneN | ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) → (𝑄 ∨ 𝑆) ≠ (𝑅 ∨ 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 2 | lplnri1.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 3 | lplnri1.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | lplnri1.p | . . 3 ⊢ 𝑃 = (LPlanes‘𝐾) | |
| 5 | lplnri1.y | . . 3 ⊢ 𝑌 = ((𝑄 ∨ 𝑅) ∨ 𝑆) | |
| 6 | 1, 2, 3, 4, 5 | lplnriaN 40521 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) → ¬ 𝑄(le‘𝐾)(𝑅 ∨ 𝑆)) |
| 7 | simpl1 1210 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝐾 ∈ HL) | |
| 8 | simpl21 1270 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝑄 ∈ 𝐴) | |
| 9 | simpl23 1272 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝑆 ∈ 𝐴) | |
| 10 | 1, 2, 3 | hlatlej1 40346 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → 𝑄(le‘𝐾)(𝑄 ∨ 𝑆)) |
| 11 | 7, 8, 9, 10 | syl3anc 1398 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝑄(le‘𝐾)(𝑄 ∨ 𝑆)) |
| 12 | simpr 490 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) | |
| 13 | 11, 12 | breqtrd 5131 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝑄(le‘𝐾)(𝑅 ∨ 𝑆)) |
| 14 | 13 | ex 418 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) → ((𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆) → 𝑄(le‘𝐾)(𝑅 ∨ 𝑆))) |
| 15 | 14 | necon3bd 2969 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) → (¬ 𝑄(le‘𝐾)(𝑅 ∨ 𝑆) → (𝑄 ∨ 𝑆) ≠ (𝑅 ∨ 𝑆))) |
| 16 | 6, 15 | mpd 16 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) → (𝑄 ∨ 𝑆) ≠ (𝑅 ∨ 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 class class class wbr 5103 ‘cfv 6528 (class class class)co 7409 lecple 17382 joincjn 18432 Atomscatm 40234 HLchlt 40321 LPlanesclpl 40463 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-proset 18415 df-poset 18434 df-plt 18449 df-lub 18465 df-glb 18466 df-join 18467 df-meet 18468 df-p0 18544 df-lat 18553 df-clat 18620 df-oposet 40147 df-ol 40149 df-oml 40150 df-covers 40237 df-ats 40238 df-atl 40269 df-cvlat 40293 df-hlat 40322 df-llines 40469 df-lplanes 40470 |
| This theorem is used by: cdleme16aN 41230 |
| Copyright terms: Public domain | W3C validator |