| 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 2763 | . . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 4 | isline2.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | 3, 4 | atbase 40492 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
| 6 | 2, 5 | syl 18 | . . . 4 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑃 ∈ (Base‘𝐾)) |
| 7 | simpl3 1212 | . . . . 5 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ 𝐴) | |
| 8 | 3, 4 | atbase 40492 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾)) |
| 9 | 7, 8 | syl 18 | . . . 4 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → 𝑄 ∈ (Base‘𝐾)) |
| 10 | isline2.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 11 | 3, 10 | latjcl 18628 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 12 | 1, 6, 9, 11 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) |
| 13 | eqid 2763 | . . . 4 ⊢ (le‘𝐾) = (le‘𝐾) | |
| 14 | isline2.m | . . . 4 ⊢ 𝑀 = (pmap‘𝐾) | |
| 15 | 3, 13, 4, 14 | pmapval 40960 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → (𝑀‘(𝑃 ∨ 𝑄)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)}) |
| 16 | 1, 12, 15 | syl2anc 596 | . 2 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)}) |
| 17 | eqid 2763 | . . 3 ⊢ {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} | |
| 18 | isline2.n | . . . 4 ⊢ 𝑁 = (Lines‘𝐾) | |
| 19 | 13, 10, 4, 18 | islinei 40943 | . . 3 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑃 ≠ 𝑄 ∧ {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} = {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)})) → {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} ∈ 𝑁) |
| 20 | 17, 19 | mpanr2 717 | . 2 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → {𝑟 ∈ 𝐴 ∣ 𝑟(le‘𝐾)(𝑃 ∨ 𝑄)} ∈ 𝑁) |
| 21 | 16, 20 | eqeltrd 2864 | 1 ⊢ (((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑃 ≠ 𝑄) → (𝑀‘(𝑃 ∨ 𝑄)) ∈ 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ≠ wne 2959 {crab 3416 class class class wbr 5106 ‘cfv 6547 (class class class)co 7430 Basecbs 17402 lecple 17450 joincjn 18500 Latclat 18620 Atomscatm 40466 Linesclines 40697 pmapcpmap 40700 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 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 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7387 df-ov 7433 df-oprab 7434 df-lub 18533 df-glb 18534 df-join 18535 df-meet 18536 df-lat 18621 df-ats 40470 df-lines 40704 df-pmap 40707 |
| This theorem is used by: cdleme3h 41438 cdleme7ga 41451 |
| Copyright terms: Public domain | W3C validator |