![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > islln3 | Structured version Visualization version GIF version |
Description: The predicate "is a lattice line". (Contributed by NM, 17-Jun-2012.) |
Ref | Expression |
---|---|
islln3.b | ⊢ 𝐵 = (Base‘𝐾) |
islln3.j | ⊢ ∨ = (join‘𝐾) |
islln3.a | ⊢ 𝐴 = (Atoms‘𝐾) |
islln3.n | ⊢ 𝑁 = (LLines‘𝐾) |
Ref | Expression |
---|---|
islln3 | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝 ∨ 𝑞)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | islln3.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
2 | eqid 2622 | . . 3 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
3 | islln3.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
4 | islln3.n | . . 3 ⊢ 𝑁 = (LLines‘𝐾) | |
5 | 1, 2, 3, 4 | islln4 34793 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 𝑝( ⋖ ‘𝐾)𝑋)) |
6 | simpll 790 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) → 𝐾 ∈ HL) | |
7 | 1, 3 | atbase 34576 | . . . . . 6 ⊢ (𝑝 ∈ 𝐴 → 𝑝 ∈ 𝐵) |
8 | 7 | adantl 482 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) → 𝑝 ∈ 𝐵) |
9 | simplr 792 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
10 | eqid 2622 | . . . . . 6 ⊢ (le‘𝐾) = (le‘𝐾) | |
11 | islln3.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
12 | 1, 10, 11, 2, 3 | cvrval3 34699 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑝 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑝( ⋖ ‘𝐾)𝑋 ↔ ∃𝑞 ∈ 𝐴 (¬ 𝑞(le‘𝐾)𝑝 ∧ (𝑝 ∨ 𝑞) = 𝑋))) |
13 | 6, 8, 9, 12 | syl3anc 1326 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) → (𝑝( ⋖ ‘𝐾)𝑋 ↔ ∃𝑞 ∈ 𝐴 (¬ 𝑞(le‘𝐾)𝑝 ∧ (𝑝 ∨ 𝑞) = 𝑋))) |
14 | hlatl 34647 | . . . . . . . . 9 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat) | |
15 | 14 | ad3antrrr 766 | . . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → 𝐾 ∈ AtLat) |
16 | simpr 477 | . . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → 𝑞 ∈ 𝐴) | |
17 | simplr 792 | . . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → 𝑝 ∈ 𝐴) | |
18 | 10, 3 | atncmp 34599 | . . . . . . . 8 ⊢ ((𝐾 ∈ AtLat ∧ 𝑞 ∈ 𝐴 ∧ 𝑝 ∈ 𝐴) → (¬ 𝑞(le‘𝐾)𝑝 ↔ 𝑞 ≠ 𝑝)) |
19 | 15, 16, 17, 18 | syl3anc 1326 | . . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → (¬ 𝑞(le‘𝐾)𝑝 ↔ 𝑞 ≠ 𝑝)) |
20 | necom 2847 | . . . . . . 7 ⊢ (𝑞 ≠ 𝑝 ↔ 𝑝 ≠ 𝑞) | |
21 | 19, 20 | syl6bb 276 | . . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → (¬ 𝑞(le‘𝐾)𝑝 ↔ 𝑝 ≠ 𝑞)) |
22 | eqcom 2629 | . . . . . . 7 ⊢ ((𝑝 ∨ 𝑞) = 𝑋 ↔ 𝑋 = (𝑝 ∨ 𝑞)) | |
23 | 22 | a1i 11 | . . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → ((𝑝 ∨ 𝑞) = 𝑋 ↔ 𝑋 = (𝑝 ∨ 𝑞))) |
24 | 21, 23 | anbi12d 747 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) ∧ 𝑞 ∈ 𝐴) → ((¬ 𝑞(le‘𝐾)𝑝 ∧ (𝑝 ∨ 𝑞) = 𝑋) ↔ (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝 ∨ 𝑞)))) |
25 | 24 | rexbidva 3049 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) → (∃𝑞 ∈ 𝐴 (¬ 𝑞(le‘𝐾)𝑝 ∧ (𝑝 ∨ 𝑞) = 𝑋) ↔ ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝 ∨ 𝑞)))) |
26 | 13, 25 | bitrd 268 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑝 ∈ 𝐴) → (𝑝( ⋖ ‘𝐾)𝑋 ↔ ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝 ∨ 𝑞)))) |
27 | 26 | rexbidva 3049 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑝 ∈ 𝐴 𝑝( ⋖ ‘𝐾)𝑋 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝 ∨ 𝑞)))) |
28 | 5, 27 | bitrd 268 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑝 ∨ 𝑞)))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∃wrex 2913 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 lecple 15948 joincjn 16944 ⋖ ccvr 34549 Atomscatm 34550 AtLatcal 34551 HLchlt 34637 LLinesclln 34777 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-preset 16928 df-poset 16946 df-plt 16958 df-lub 16974 df-glb 16975 df-join 16976 df-meet 16977 df-p0 17039 df-lat 17046 df-clat 17108 df-oposet 34463 df-ol 34465 df-oml 34466 df-covers 34553 df-ats 34554 df-atl 34585 df-cvlat 34609 df-hlat 34638 df-llines 34784 |
This theorem is referenced by: islln2 34797 llni2 34798 atcvrlln2 34805 atcvrlln 34806 llnexchb2 35155 |
Copyright terms: Public domain | W3C validator |