| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > islln4 | Structured version Visualization version GIF version | ||
| Description: The predicate "is a lattice line". (Contributed by NM, 16-Jun-2012.) |
| Ref | Expression |
|---|---|
| llnset.b | ⊢ 𝐵 = (Base‘𝐾) |
| llnset.c | ⊢ 𝐶 = ( ⋖ ‘𝐾) |
| llnset.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| llnset.n | ⊢ 𝑁 = (LLines‘𝐾) |
| Ref | Expression |
|---|---|
| islln4 | ⊢ ((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | llnset.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | llnset.c | . . 3 ⊢ 𝐶 = ( ⋖ ‘𝐾) | |
| 3 | llnset.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | llnset.n | . . 3 ⊢ 𝑁 = (LLines‘𝐾) | |
| 5 | 1, 2, 3, 4 | islln 40090 | . 2 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑋))) |
| 6 | 5 | baibd 547 | 1 ⊢ ((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∃wrex 3085 class class class wbr 5097 ‘cfv 6515 Basecbs 17235 ⋖ ccvr 39846 Atomscatm 39847 LLinesclln 40075 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-iota 6471 df-fun 6517 df-fv 6523 df-llines 40082 |
| This theorem is referenced by: islln3 40094 llncmp 40106 |
| Copyright terms: Public domain | W3C validator |