Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > isline2 | Structured version Visualization version GIF version |
Description: Definition of line in terms of projective map. (Contributed by NM, 25-Jan-2012.) |
Ref | Expression |
---|---|
isline2.j | ⊢ ∨ = (join‘𝐾) |
isline2.a | ⊢ 𝐴 = (Atoms‘𝐾) |
isline2.n | ⊢ 𝑁 = (Lines‘𝐾) |
isline2.m | ⊢ 𝑀 = (pmap‘𝐾) |
Ref | Expression |
---|---|
isline2 | ⊢ (𝐾 ∈ Lat → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑀‘(𝑝 ∨ 𝑞))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2823 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
2 | isline2.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
3 | isline2.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
4 | isline2.n | . . 3 ⊢ 𝑁 = (Lines‘𝐾) | |
5 | 1, 2, 3, 4 | isline 36877 | . 2 ⊢ (𝐾 ∈ Lat → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}))) |
6 | simpl 485 | . . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝐾 ∈ Lat) | |
7 | eqid 2823 | . . . . . . . . 9 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
8 | 7, 3 | atbase 36427 | . . . . . . . 8 ⊢ (𝑝 ∈ 𝐴 → 𝑝 ∈ (Base‘𝐾)) |
9 | 8 | ad2antrl 726 | . . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝑝 ∈ (Base‘𝐾)) |
10 | 7, 3 | atbase 36427 | . . . . . . . 8 ⊢ (𝑞 ∈ 𝐴 → 𝑞 ∈ (Base‘𝐾)) |
11 | 10 | ad2antll 727 | . . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝑞 ∈ (Base‘𝐾)) |
12 | 7, 2 | latjcl 17663 | . . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ 𝑝 ∈ (Base‘𝐾) ∧ 𝑞 ∈ (Base‘𝐾)) → (𝑝 ∨ 𝑞) ∈ (Base‘𝐾)) |
13 | 6, 9, 11, 12 | syl3anc 1367 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (𝑝 ∨ 𝑞) ∈ (Base‘𝐾)) |
14 | isline2.m | . . . . . . 7 ⊢ 𝑀 = (pmap‘𝐾) | |
15 | 7, 1, 3, 14 | pmapval 36895 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∨ 𝑞) ∈ (Base‘𝐾)) → (𝑀‘(𝑝 ∨ 𝑞)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}) |
16 | 13, 15 | syldan 593 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (𝑀‘(𝑝 ∨ 𝑞)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}) |
17 | 16 | eqeq2d 2834 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (𝑋 = (𝑀‘(𝑝 ∨ 𝑞)) ↔ 𝑋 = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)})) |
18 | 17 | anbi2d 630 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → ((𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑀‘(𝑝 ∨ 𝑞))) ↔ (𝑝 ≠ 𝑞 ∧ 𝑋 = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}))) |
19 | 18 | 2rexbidva 3301 | . 2 ⊢ (𝐾 ∈ Lat → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑀‘(𝑝 ∨ 𝑞))) ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}))) |
20 | 5, 19 | bitr4d 284 | 1 ⊢ (𝐾 ∈ Lat → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑀‘(𝑝 ∨ 𝑞))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∃wrex 3141 {crab 3144 class class class wbr 5068 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 lecple 16574 joincjn 17556 Latclat 17657 Atomscatm 36401 Linesclines 36632 pmapcpmap 36635 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-lub 17586 df-glb 17587 df-join 17588 df-meet 17589 df-lat 17658 df-ats 36405 df-lines 36639 df-pmap 36642 |
This theorem is referenced by: isline3 36914 lncvrelatN 36919 linepsubclN 37089 |
Copyright terms: Public domain | W3C validator |