| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > llnn0 | Structured version Visualization version GIF version | ||
| Description: A lattice line is nonzero. (Contributed by NM, 15-Jul-2012.) |
| Ref | Expression |
|---|---|
| llnn0.z | ⊢ 0 = (0.‘𝐾) |
| llnn0.n | ⊢ 𝑁 = (LLines‘𝐾) |
| Ref | Expression |
|---|---|
| llnn0 | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) → 𝑋 ≠ 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . . . . 5 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 2 | 1 | atex 40279 | . . . 4 ⊢ (𝐾 ∈ HL → (Atoms‘𝐾) ≠ ∅) |
| 3 | n0 4300 | . . . 4 ⊢ ((Atoms‘𝐾) ≠ ∅ ↔ ∃𝑝 𝑝 ∈ (Atoms‘𝐾)) | |
| 4 | 2, 3 | sylib 221 | . . 3 ⊢ (𝐾 ∈ HL → ∃𝑝 𝑝 ∈ (Atoms‘𝐾)) |
| 5 | 4 | adantr 486 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) → ∃𝑝 𝑝 ∈ (Atoms‘𝐾)) |
| 6 | eqid 2760 | . . . . 5 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 7 | llnn0.n | . . . . 5 ⊢ 𝑁 = (LLines‘𝐾) | |
| 8 | 6, 1, 7 | llnnleat 40386 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑝 ∈ (Atoms‘𝐾)) → ¬ 𝑋(le‘𝐾)𝑝) |
| 9 | 8 | 3expa 1136 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → ¬ 𝑋(le‘𝐾)𝑝) |
| 10 | hlop 40235 | . . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP) | |
| 11 | 10 | ad2antrr 739 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → 𝐾 ∈ OP) |
| 12 | eqid 2760 | . . . . . . . 8 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 13 | 12, 1 | atbase 40162 | . . . . . . 7 ⊢ (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ (Base‘𝐾)) |
| 14 | 13 | adantl 487 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → 𝑝 ∈ (Base‘𝐾)) |
| 15 | llnn0.z | . . . . . . 7 ⊢ 0 = (0.‘𝐾) | |
| 16 | 12, 6, 15 | op0le 40059 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑝 ∈ (Base‘𝐾)) → 0 (le‘𝐾)𝑝) |
| 17 | 11, 14, 16 | syl2anc 596 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → 0 (le‘𝐾)𝑝) |
| 18 | breq1 5106 | . . . . 5 ⊢ (𝑋 = 0 → (𝑋(le‘𝐾)𝑝 ↔ 0 (le‘𝐾)𝑝)) | |
| 19 | 17, 18 | syl5ibrcom 250 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → (𝑋 = 0 → 𝑋(le‘𝐾)𝑝)) |
| 20 | 19 | necon3bd 2969 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → (¬ 𝑋(le‘𝐾)𝑝 → 𝑋 ≠ 0 )) |
| 21 | 9, 20 | mpd 16 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → 𝑋 ≠ 0 ) |
| 22 | 5, 21 | exlimddv 1968 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) → 𝑋 ≠ 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2955 ∅c0 4279 class class class wbr 5103 ‘cfv 6533 Basecbs 17301 lecple 17349 0.cp0 18509 OPcops 40045 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-p1 18512 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: 2llnm3N 40442 cdleme22b 41214 |
| Copyright terms: Public domain | W3C validator |