| 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 40557 | . . . 4 ⊢ (𝐾 ∈ HL → (Atoms‘𝐾) ≠ ∅) |
| 3 | n0 4299 | . . . 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 40664 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑝 ∈ (Atoms‘𝐾)) → ¬ 𝑋(le‘𝐾)𝑝) |
| 9 | 8 | 3expa 1136 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → ¬ 𝑋(le‘𝐾)𝑝) |
| 10 | hlop 40513 | . . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP) | |
| 11 | 10 | ad2antrr 739 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → 𝐾 ∈ OP) |
| 12 | eqid 2760 | . . . . . . . 8 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 13 | 12, 1 | atbase 40440 | . . . . . . 7 ⊢ (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ (Base‘𝐾)) |
| 14 | 13 | adantl 487 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → 𝑝 ∈ (Base‘𝐾)) |
| 15 | llnn0.z | . . . . . . 7 ⊢ 0 = (0.‘𝐾) | |
| 16 | 12, 6, 15 | op0le 40337 | . . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑝 ∈ (Base‘𝐾)) → 0 (le‘𝐾)𝑝) |
| 17 | 11, 14, 16 | syl2anc 596 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) ∧ 𝑝 ∈ (Atoms‘𝐾)) → 0 (le‘𝐾)𝑝) |
| 18 | breq1 5105 | . . . . 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 1967 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁) → 𝑋 ≠ 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∃wex 1811 ∈ wcel 2144 ≠ wne 2955 ∅c0 4278 class class class wbr 5102 ‘cfv 6539 Basecbs 17393 lecple 17441 0.cp0 18601 OPcops 40323 Atomscatm 40414 HLchlt 40501 LLinesclln 40642 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-proset 18474 df-poset 18493 df-plt 18508 df-lub 18524 df-glb 18525 df-join 18526 df-meet 18527 df-p0 18603 df-p1 18604 df-lat 18612 df-clat 18679 df-oposet 40327 df-ol 40329 df-oml 40330 df-covers 40417 df-ats 40418 df-atl 40449 df-cvlat 40473 df-hlat 40502 df-llines 40649 |
| This theorem is used by: 2llnm3N 40720 cdleme22b 41492 |
| Copyright terms: Public domain | W3C validator |