| 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 2765 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 4 | isline2.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | 3, 4 | atbase 40123 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
| 6 | 2, 5 | syl 18 | . . . 4 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑃 ∈ (Base‘𝐾)) |
| 7 | simpl3 1212 | . . . . 5 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ 𝐴) | |
| 8 | 3, 4 | atbase 40123 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾)) |
| 9 | 7, 8 | syl 18 | . . . 4 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ (Base‘𝐾)) |
| 10 | isline2.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 11 | 3, 10 | latjcl 18519 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 12 | 1, 6, 9, 11 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 13 | eqid 2765 | . . . 4 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 14 | isline2.m | . . . 4 ⊢ 𝑀 = (pmap‘𝐾) | |
| 15 | 3, 13, 4, 14 | pmapval 40591 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → (𝑀‘(𝑃 ∨ 𝑄)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)}) |
| 16 | 1, 12, 15 | syl2anc 596 | . 2 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)}) |
| 17 | eqid 2765 | . . 3 ⊢ {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} | |
| 18 | isline2.n | . . . 4 ⊢ 𝑁 = (Lines‘𝐾) | |
| 19 | 13, 10, 4, 18 | islinei 40574 | . . 3 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑃 ≠ 𝑄 ∧ {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)})) → {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} ∈ 𝑁) |
| 20 | 17, 19 | mpanr2 717 | . 2 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} ∈ 𝑁) |
| 21 | 16, 20 | eqeltrd 2865 | 1 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) ∈ 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 {crab 3418 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 Basecbs 17293 lecple 17341 joincjn 18391 Latclat 18511 Atomscatm 40097 Linesclines 40328 pmapcpmap 40331 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-lub 18424 df-glb 18425 df-join 18426 df-meet 18427 df-lat 18512 df-ats 40101 df-lines 40335 df-pmap 40338 |
| This theorem is used by: cdleme3h 41069 cdleme7ga 41082 |
| Copyright terms: Public domain | W3C validator |