| 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 7456 | . . . . . 6 ⊢ (𝑃 = 𝑄 → (𝑃 ∨ 𝑄) = (𝑄 ∨ 𝑄)) | |
| 2 | islln2a.j | . . . . . . . 8 ⊢ ∨ = (join‘𝐾) | |
| 3 | islln2a.a | . . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | 2, 3 | hlatjidm 40685 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄) |
| 5 | 4 | 3adant2 1149 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑄) = 𝑄) |
| 6 | 1, 5 | sylan9eqr 2820 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 = 𝑄) → (𝑃 ∨ 𝑄) = 𝑄) |
| 7 | islln2a.n | . . . . . . . . . . 11 ⊢ 𝑁 = (LLines‘𝐾) | |
| 8 | 3, 7 | llnneat 40830 | . . . . . . . . . 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 2884 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 = 𝑄) → ¬ (𝑃 ∨ 𝑄) ∈ 𝑁) |
| 15 | 14 | ex 418 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 = 𝑄 → ¬ (𝑃 ∨ 𝑄) ∈ 𝑁)) |
| 16 | 15 | necon2ad 2974 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ((𝑃 ∨ 𝑄) ∈ 𝑁 → 𝑃 ≠ 𝑄)) |
| 17 | 2, 3, 7 | llni2 40828 | . . 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 2147 ≠ wne 2959 ‘cfv 6564 (class class class)co 7449 joincjn 18526 Atomscatm 40579 HLchlt 40666 LLinesclln 40807 |
| 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 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7781 |
| 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 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6518 df-fun 6566 df-fn 6567 df-f 6568 df-f1 6569 df-fo 6570 df-f1o 6571 df-fv 6572 df-riota 7406 df-ov 7452 df-oprab 7453 df-proset 18509 df-poset 18528 df-plt 18543 df-lub 18559 df-glb 18560 df-join 18561 df-meet 18562 df-p0 18638 df-lat 18647 df-clat 18714 df-oposet 40492 df-ol 40494 df-oml 40495 df-covers 40582 df-ats 40583 df-atl 40614 df-cvlat 40638 df-hlat 40667 df-llines 40814 |
| This theorem is used by: cdleme16d 41597 |
| Copyright terms: Public domain | W3C validator |