| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > linepmap | Structured version Visualization version GIF version | ||
| Description: A line described with a projective map. (Contributed by NM, 3-Feb-2012.) |
| Ref | Expression |
|---|---|
| isline2.j | ⊢ ∨ = (join‘𝐾) |
| isline2.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| isline2.n | ⊢ 𝑁 = (Lines‘𝐾) |
| isline2.m | ⊢ 𝑀 = (pmap‘𝐾) |
| Ref | Expression |
|---|---|
| linepmap | ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) ∈ 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl1 1210 | . . 3 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝐾 ∈ Lat) | |
| 2 | simpl2 1211 | . . . . 5 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑃 ∈ 𝐴) | |
| 3 | eqid 2760 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 4 | isline2.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | 3, 4 | atbase 40176 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
| 6 | 2, 5 | syl 18 | . . . 4 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑃 ∈ (Base‘𝐾)) |
| 7 | simpl3 1212 | . . . . 5 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ 𝐴) | |
| 8 | 3, 4 | atbase 40176 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾)) |
| 9 | 7, 8 | syl 18 | . . . 4 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ (Base‘𝐾)) |
| 10 | isline2.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 11 | 3, 10 | latjcl 18549 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 12 | 1, 6, 9, 11 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 13 | eqid 2760 | . . . 4 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 14 | isline2.m | . . . 4 ⊢ 𝑀 = (pmap‘𝐾) | |
| 15 | 3, 13, 4, 14 | pmapval 40644 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → (𝑀‘(𝑃 ∨ 𝑄)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)}) |
| 16 | 1, 12, 15 | syl2anc 596 | . 2 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)}) |
| 17 | eqid 2760 | . . 3 ⊢ {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} | |
| 18 | isline2.n | . . . 4 ⊢ 𝑁 = (Lines‘𝐾) | |
| 19 | 13, 10, 4, 18 | islinei 40627 | . . 3 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑃 ≠ 𝑄 ∧ {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)})) → {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} ∈ 𝑁) |
| 20 | 17, 19 | mpanr2 717 | . 2 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} ∈ 𝑁) |
| 21 | 16, 20 | eqeltrd 2860 | 1 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) ∈ 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 {crab 3412 class class class wbr 5103 ‘cfv 6534 (class class class)co 7415 Basecbs 17323 lecple 17371 joincjn 18421 Latclat 18541 Atomscatm 40150 Linesclines 40381 pmapcpmap 40384 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7372 df-ov 7418 df-oprab 7419 df-lub 18454 df-glb 18455 df-join 18456 df-meet 18457 df-lat 18542 df-ats 40154 df-lines 40388 df-pmap 40391 |
| This theorem is used by: cdleme3h 41122 cdleme7ga 41135 |
| Copyright terms: Public domain | W3C validator |