| 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 2763 | . . 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 40798 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) → ¬ 𝑄(le‘𝐾)(𝑅 ∨ 𝑆)) |
| 7 | simpl1 1210 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝐾 ∈ HL) | |
| 8 | simpl21 1270 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝑄 ∈ 𝐴) | |
| 9 | simpl23 1272 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝑆 ∈ 𝐴) | |
| 10 | 1, 2, 3 | hlatlej1 40623 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → 𝑄(le‘𝐾)(𝑄 ∨ 𝑆)) |
| 11 | 7, 8, 9, 10 | syl3anc 1399 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝑄(le‘𝐾)(𝑄 ∨ 𝑆)) |
| 12 | simpr 490 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) | |
| 13 | 11, 12 | breqtrd 5134 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) ∧ (𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆)) → 𝑄(le‘𝐾)(𝑅 ∨ 𝑆)) |
| 14 | 13 | ex 418 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑌 ∈ 𝑃) → ((𝑄 ∨ 𝑆) = (𝑅 ∨ 𝑆) → 𝑄(le‘𝐾)(𝑅 ∨ 𝑆))) |
| 15 | 14 | necon3bd 2973 | . 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 2147 ≠ wne 2959 class class class wbr 5106 ‘cfv 6555 (class class class)co 7440 lecple 17461 joincjn 18511 Atomscatm 40511 HLchlt 40598 LPlanesclpl 40740 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-proset 18494 df-poset 18513 df-plt 18528 df-lub 18544 df-glb 18545 df-join 18546 df-meet 18547 df-p0 18623 df-lat 18632 df-clat 18699 df-oposet 40424 df-ol 40426 df-oml 40427 df-covers 40514 df-ats 40515 df-atl 40546 df-cvlat 40570 df-hlat 40599 df-llines 40746 df-lplanes 40747 |
| This theorem is used by: cdleme16aN 41507 |
| Copyright terms: Public domain | W3C validator |