| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > islln2a | Structured version Visualization version GIF version | ||
| Description: The predicate "is a lattice line" in terms of atoms. (Contributed by NM, 15-Jul-2012.) |
| Ref | Expression |
|---|---|
| islln2a.j | ⊢ ∨ = (join‘𝐾) |
| islln2a.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| islln2a.n | ⊢ 𝑁 = (LLines‘𝐾) |
| Ref | Expression |
|---|---|
| islln2a | ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ((𝑃 ∨ 𝑄) ∈ 𝑁 ↔ 𝑃 ≠ 𝑄)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7420 | . . . . . 6 ⊢ (𝑃 = 𝑄 → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑄)) | |
| 2 | islln2a.j | . . . . . . . 8 ⊢ ∨ = (join‘𝐾) | |
| 3 | islln2a.a | . . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | 2, 3 | hlatjidm 40242 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄) |
| 5 | 4 | 3adant2 1149 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄) |
| 6 | 1, 5 | sylan9eqr 2817 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 = 𝑄) → (𝑃 ∨ 𝑄) = 𝑄) |
| 7 | islln2a.n | . . . . . . . . . . 11 ⊢ 𝑁 = (LLines‘𝐾) | |
| 8 | 3, 7 | llnneat 40387 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝑁) → ¬ 𝑄 ∈ 𝐴) |
| 9 | 8 | adantlr 728 | . . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) ∧ 𝑄 ∈ 𝑁) → ¬ 𝑄 ∈ 𝐴) |
| 10 | 9 | ex 418 | . . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) → (𝑄 ∈ 𝑁 → ¬ 𝑄 ∈ 𝐴)) |
| 11 | 10 | con2d 135 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) → (𝑄 ∈ 𝐴 → ¬ 𝑄 ∈ 𝑁)) |
| 12 | 11 | 3impia 1135 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ¬ 𝑄 ∈ 𝑁) |
| 13 | 12 | adantr 486 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 = 𝑄) → ¬ 𝑄 ∈ 𝑁) |
| 14 | 6, 13 | eqneltrd 2880 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 = 𝑄) → ¬ (𝑃 ∨ 𝑄) ∈ 𝑁) |
| 15 | 14 | ex 418 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 = 𝑄 → ¬ (𝑃 ∨ 𝑄) ∈ 𝑁)) |
| 16 | 15 | necon2ad 2970 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ((𝑃 ∨ 𝑄) ∈ 𝑁 → 𝑃 ≠ 𝑄)) |
| 17 | 2, 3, 7 | llni2 40385 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑃 ∨ 𝑄) ∈ 𝑁) |
| 18 | 17 | ex 418 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ≠ 𝑄 → (𝑃 ∨ 𝑄) ∈ 𝑁)) |
| 19 | 16, 18 | impbid 215 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ((𝑃 ∨ 𝑄) ∈ 𝑁 ↔ 𝑃 ≠ 𝑄)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ‘cfv 6533 (class class class)co 7413 joincjn 18399 Atomscatm 40136 HLchlt 40223 LLinesclln 40364 |
| 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 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| 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 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 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-proset 18382 df-poset 18401 df-plt 18416 df-lub 18432 df-glb 18433 df-join 18434 df-meet 18435 df-p0 18511 df-lat 18520 df-clat 18587 df-oposet 40049 df-ol 40051 df-oml 40052 df-covers 40139 df-ats 40140 df-atl 40171 df-cvlat 40195 df-hlat 40224 df-llines 40371 |
| This theorem is used by: cdleme16d 41154 |
| Copyright terms: Public domain | W3C validator |