| 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 7430 | . . . . . 6 ⊢ (𝑃 = 𝑄 → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑄)) | |
| 2 | islln2a.j | . . . . . . . 8 ⊢ ∨ = (join‘𝐾) | |
| 3 | islln2a.a | . . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | 2, 3 | hlatjidm 40184 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄) |
| 5 | 4 | 3adant2 1149 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄) |
| 6 | 1, 5 | sylan9eqr 2823 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 = 𝑄) → (𝑃 ∨ 𝑄) = 𝑄) |
| 7 | islln2a.n | . . . . . . . . . . 11 ⊢ 𝑁 = (LLines‘𝐾) | |
| 8 | 3, 7 | llnneat 40329 | . . . . . . . . . 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 2886 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 = 𝑄) → ¬ (𝑃 ∨ 𝑄) ∈ 𝑁) |
| 15 | 14 | ex 418 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 = 𝑄 → ¬ (𝑃 ∨ 𝑄) ∈ 𝑁)) |
| 16 | 15 | necon2ad 2976 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ((𝑃 ∨ 𝑄) ∈ 𝑁 → 𝑃 ≠ 𝑄)) |
| 17 | 2, 3, 7 | llni2 40327 | . . 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 2146 ≠ wne 2961 ‘cfv 6543 (class class class)co 7423 joincjn 18392 Atomscatm 40078 HLchlt 40165 LLinesclln 40306 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-proset 18375 df-poset 18394 df-plt 18409 df-lub 18425 df-glb 18426 df-join 18427 df-meet 18428 df-p0 18504 df-lat 18513 df-clat 18580 df-oposet 39991 df-ol 39993 df-oml 39994 df-covers 40081 df-ats 40082 df-atl 40113 df-cvlat 40137 df-hlat 40166 df-llines 40313 |
| This theorem is used by: cdleme16d 41096 |
| Copyright terms: Public domain | W3C validator |