| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dia2dimlem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for dia2dim 42280. Show that the composition (sum) of translations (vectors) 𝐺 and 𝐷 equals 𝐹. Part of proof of Lemma M in [Crawley] p. 121 line 5. (Contributed by NM, 8-Sep-2014.) |
| Ref | Expression |
|---|---|
| dia2dimlem4.l | ⊢ ≤ = (le‘𝐾) |
| dia2dimlem4.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| dia2dimlem4.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| dia2dimlem4.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| dia2dimlem4.k | ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
| dia2dimlem4.p | ⊢ (𝜑 → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) |
| dia2dimlem4.f | ⊢ (𝜑 → 𝐹 ∈ 𝑇) |
| dia2dimlem4.g | ⊢ (𝜑 → 𝐺 ∈ 𝑇) |
| dia2dimlem4.gv | ⊢ (𝜑 → (𝐺‘𝑃) = 𝑄) |
| dia2dimlem4.d | ⊢ (𝜑 → 𝐷 ∈ 𝑇) |
| dia2dimlem4.dv | ⊢ (𝜑 → (𝐷‘𝑄) = (𝐹‘𝑃)) |
| Ref | Expression |
|---|---|
| dia2dimlem4 | ⊢ (𝜑 → (𝐷 ∘ 𝐺) = 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dia2dimlem4.k | . 2 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 2 | dia2dimlem4.d | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑇) | |
| 3 | dia2dimlem4.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑇) | |
| 4 | dia2dimlem4.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 5 | dia2dimlem4.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 6 | 4, 5 | ltrnco 41922 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐷 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐷 ∘ 𝐺) ∈ 𝑇) |
| 7 | 1, 2, 3, 6 | syl3anc 1398 | . 2 ⊢ (𝜑 → (𝐷 ∘ 𝐺) ∈ 𝑇) |
| 8 | dia2dimlem4.f | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑇) | |
| 9 | dia2dimlem4.p | . 2 ⊢ (𝜑 → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
| 10 | 9 | simpld 500 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ 𝐴) |
| 11 | dia2dimlem4.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 12 | dia2dimlem4.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 13 | 11, 12, 4, 5 | ltrncoval 41348 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐷 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐷‘(𝐺‘𝑃))) |
| 14 | 1, 2, 3, 10, 13 | syl121anc 1402 | . . 3 ⊢ (𝜑 → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐷‘(𝐺‘𝑃))) |
| 15 | dia2dimlem4.gv | . . . 4 ⊢ (𝜑 → (𝐺‘𝑃) = 𝑄) | |
| 16 | 15 | fveq2d 6900 | . . 3 ⊢ (𝜑 → (𝐷‘(𝐺‘𝑃)) = (𝐷‘𝑄)) |
| 17 | dia2dimlem4.dv | . . 3 ⊢ (𝜑 → (𝐷‘𝑄) = (𝐹‘𝑃)) | |
| 18 | 14, 16, 17 | 3eqtrd 2802 | . 2 ⊢ (𝜑 → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐹‘𝑃)) |
| 19 | 11, 12, 4, 5 | cdlemd 41410 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐷 ∘ 𝐺) ∈ 𝑇 ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ ((𝐷 ∘ 𝐺)‘𝑃) = (𝐹‘𝑃)) → (𝐷 ∘ 𝐺) = 𝐹) |
| 20 | 1, 7, 8, 9, 18, 19 | syl311anc 1411 | 1 ⊢ (𝜑 → (𝐷 ∘ 𝐺) = 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 class class class wbr 5106 ∘ ccom 5659 ‘cfv 6547 lecple 17450 Atomscatm 40466 HLchlt 40553 LHypclh 41187 LTrncltrn 41304 |
| 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 ax-riotaBAD 40156 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-iin 4957 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-mpo 7435 df-1st 8011 df-2nd 8012 df-undef 8304 df-map 8863 df-proset 18483 df-poset 18502 df-plt 18517 df-lub 18533 df-glb 18534 df-join 18535 df-meet 18536 df-p0 18612 df-p1 18613 df-lat 18621 df-clat 18688 df-oposet 40379 df-ol 40381 df-oml 40382 df-covers 40469 df-ats 40470 df-atl 40501 df-cvlat 40525 df-hlat 40554 df-llines 40701 df-lplanes 40702 df-lvols 40703 df-lines 40704 df-psubsp 40706 df-pmap 40707 df-padd 40999 df-lhyp 41191 df-laut 41192 df-ldil 41307 df-ltrn 41308 df-trl 41362 |
| This theorem is used by: dia2dimlem5 42271 |
| Copyright terms: Public domain | W3C validator |