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 2739 | . . 3 ⊢ (le‘𝐾) = (le‘𝐾) | |
2 | isline2.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
3 | isline2.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
4 | isline2.n | . . 3 ⊢ 𝑁 = (Lines‘𝐾) | |
5 | 1, 2, 3, 4 | isline 37732 | . 2 ⊢ (𝐾 ∈ Lat → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}))) |
6 | simpl 482 | . . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝐾 ∈ Lat) | |
7 | eqid 2739 | . . . . . . . . 9 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
8 | 7, 3 | atbase 37282 | . . . . . . . 8 ⊢ (𝑝 ∈ 𝐴 → 𝑝 ∈ (Base‘𝐾)) |
9 | 8 | ad2antrl 724 | . . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝑝 ∈ (Base‘𝐾)) |
10 | 7, 3 | atbase 37282 | . . . . . . . 8 ⊢ (𝑞 ∈ 𝐴 → 𝑞 ∈ (Base‘𝐾)) |
11 | 10 | ad2antll 725 | . . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝑞 ∈ (Base‘𝐾)) |
12 | 7, 2 | latjcl 18138 | . . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ 𝑝 ∈ (Base‘𝐾) ∧ 𝑞 ∈ (Base‘𝐾)) → (𝑝 ∨ 𝑞) ∈ (Base‘𝐾)) |
13 | 6, 9, 11, 12 | syl3anc 1369 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (𝑝 ∨ 𝑞) ∈ (Base‘𝐾)) |
14 | isline2.m | . . . . . . 7 ⊢ 𝑀 = (pmap‘𝐾) | |
15 | 7, 1, 3, 14 | pmapval 37750 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∨ 𝑞) ∈ (Base‘𝐾)) → (𝑀‘(𝑝 ∨ 𝑞)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}) |
16 | 13, 15 | syldan 590 | . . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (𝑀‘(𝑝 ∨ 𝑞)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}) |
17 | 16 | eqeq2d 2750 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (𝑋 = (𝑀‘(𝑝 ∨ 𝑞)) ↔ 𝑋 = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)})) |
18 | 17 | anbi2d 628 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → ((𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑀‘(𝑝 ∨ 𝑞))) ↔ (𝑝 ≠ 𝑞 ∧ 𝑋 = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}))) |
19 | 18 | 2rexbidva 3229 | . 2 ⊢ (𝐾 ∈ Lat → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑀‘(𝑝 ∨ 𝑞))) ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑝 ∨ 𝑞)}))) |
20 | 5, 19 | bitr4d 281 | 1 ⊢ (𝐾 ∈ Lat → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑋 = (𝑀‘(𝑝 ∨ 𝑞))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1541 ∈ wcel 2109 ≠ wne 2944 ∃wrex 3066 {crab 3069 class class class wbr 5078 ‘cfv 6430 (class class class)co 7268 Basecbs 16893 lecple 16950 joincjn 18010 Latclat 18130 Atomscatm 37256 Linesclines 37487 pmapcpmap 37490 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-rep 5213 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4845 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-id 5488 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-riota 7225 df-ov 7271 df-oprab 7272 df-lub 18045 df-glb 18046 df-join 18047 df-meet 18048 df-lat 18131 df-ats 37260 df-lines 37494 df-pmap 37497 |
This theorem is referenced by: isline3 37769 lncvrelatN 37774 linepsubclN 37944 |
Copyright terms: Public domain | W3C validator |