![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > islpln3 | Structured version Visualization version GIF version |
Description: The predicate "is a lattice plane". (Contributed by NM, 17-Jun-2012.) |
Ref | Expression |
---|---|
islpln3.b | ⊢ 𝐵 = (Base‘𝐾) |
islpln3.l | ⊢ ≤ = (le‘𝐾) |
islpln3.j | ⊢ ∨ = (join‘𝐾) |
islpln3.a | ⊢ 𝐴 = (Atoms‘𝐾) |
islpln3.n | ⊢ 𝑁 = (LLines‘𝐾) |
islpln3.p | ⊢ 𝑃 = (LPlanes‘𝐾) |
Ref | Expression |
---|---|
islpln3 | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑃 ↔ ∃𝑦 ∈ 𝑁 ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑝)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | islpln3.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
2 | eqid 2826 | . . 3 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
3 | islpln3.n | . . 3 ⊢ 𝑁 = (LLines‘𝐾) | |
4 | islpln3.p | . . 3 ⊢ 𝑃 = (LPlanes‘𝐾) | |
5 | 1, 2, 3, 4 | islpln4 35607 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑃 ↔ ∃𝑦 ∈ 𝑁 𝑦( ⋖ ‘𝐾)𝑋)) |
6 | simpll 785 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝑁) → 𝐾 ∈ HL) | |
7 | 1, 3 | llnbase 35585 | . . . . . 6 ⊢ (𝑦 ∈ 𝑁 → 𝑦 ∈ 𝐵) |
8 | 7 | adantl 475 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝑁) → 𝑦 ∈ 𝐵) |
9 | simplr 787 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝑁) → 𝑋 ∈ 𝐵) | |
10 | islpln3.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
11 | islpln3.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
12 | islpln3.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
13 | 1, 10, 11, 2, 12 | cvrval3 35489 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑦 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑦( ⋖ ‘𝐾)𝑋 ↔ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑦 ∧ (𝑦 ∨ 𝑝) = 𝑋))) |
14 | 6, 8, 9, 13 | syl3anc 1496 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝑁) → (𝑦( ⋖ ‘𝐾)𝑋 ↔ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑦 ∧ (𝑦 ∨ 𝑝) = 𝑋))) |
15 | eqcom 2833 | . . . . . . 7 ⊢ ((𝑦 ∨ 𝑝) = 𝑋 ↔ 𝑋 = (𝑦 ∨ 𝑝)) | |
16 | 15 | a1i 11 | . . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝑁) ∧ 𝑝 ∈ 𝐴) → ((𝑦 ∨ 𝑝) = 𝑋 ↔ 𝑋 = (𝑦 ∨ 𝑝))) |
17 | 16 | anbi2d 624 | . . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝑁) ∧ 𝑝 ∈ 𝐴) → ((¬ 𝑝 ≤ 𝑦 ∧ (𝑦 ∨ 𝑝) = 𝑋) ↔ (¬ 𝑝 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑝)))) |
18 | 17 | rexbidva 3260 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝑁) → (∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑦 ∧ (𝑦 ∨ 𝑝) = 𝑋) ↔ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑝)))) |
19 | 14, 18 | bitrd 271 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝑁) → (𝑦( ⋖ ‘𝐾)𝑋 ↔ ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑝)))) |
20 | 19 | rexbidva 3260 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑦 ∈ 𝑁 𝑦( ⋖ ‘𝐾)𝑋 ↔ ∃𝑦 ∈ 𝑁 ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑝)))) |
21 | 5, 20 | bitrd 271 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑃 ↔ ∃𝑦 ∈ 𝑁 ∃𝑝 ∈ 𝐴 (¬ 𝑝 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑝)))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 386 = wceq 1658 ∈ wcel 2166 ∃wrex 3119 class class class wbr 4874 ‘cfv 6124 (class class class)co 6906 Basecbs 16223 lecple 16313 joincjn 17298 ⋖ ccvr 35338 Atomscatm 35339 HLchlt 35426 LLinesclln 35567 LPlanesclpl 35568 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-8 2168 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2391 ax-ext 2804 ax-rep 4995 ax-sep 5006 ax-nul 5014 ax-pow 5066 ax-pr 5128 ax-un 7210 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3an 1115 df-tru 1662 df-ex 1881 df-nf 1885 df-sb 2070 df-mo 2606 df-eu 2641 df-clab 2813 df-cleq 2819 df-clel 2822 df-nfc 2959 df-ne 3001 df-ral 3123 df-rex 3124 df-reu 3125 df-rab 3127 df-v 3417 df-sbc 3664 df-csb 3759 df-dif 3802 df-un 3804 df-in 3806 df-ss 3813 df-nul 4146 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-op 4405 df-uni 4660 df-iun 4743 df-br 4875 df-opab 4937 df-mpt 4954 df-id 5251 df-xp 5349 df-rel 5350 df-cnv 5351 df-co 5352 df-dm 5353 df-rn 5354 df-res 5355 df-ima 5356 df-iota 6087 df-fun 6126 df-fn 6127 df-f 6128 df-f1 6129 df-fo 6130 df-f1o 6131 df-fv 6132 df-riota 6867 df-ov 6909 df-oprab 6910 df-proset 17282 df-poset 17300 df-plt 17312 df-lub 17328 df-glb 17329 df-join 17330 df-meet 17331 df-p0 17393 df-lat 17400 df-clat 17462 df-oposet 35252 df-ol 35254 df-oml 35255 df-covers 35342 df-ats 35343 df-atl 35374 df-cvlat 35398 df-hlat 35427 df-llines 35574 df-lplanes 35575 |
This theorem is referenced by: islpln5 35611 lplnexllnN 35640 |
Copyright terms: Public domain | W3C validator |