| 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 41953. 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 41595 | . . 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 41021 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐷 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐷‘(𝐺‘𝑃))) |
| 14 | 1, 2, 3, 10, 13 | syl121anc 1402 | . . 3 ⊢ (𝜑 → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐷‘(𝐺‘𝑃))) |
| 15 | dia2dimlem4.gv | . . . 4 ⊢ (𝜑 → (𝐺‘𝑃) = 𝑄) | |
| 16 | 15 | fveq2d 6883 | . . 3 ⊢ (𝜑 → (𝐷‘(𝐺‘𝑃)) = (𝐷‘𝑄)) |
| 17 | dia2dimlem4.dv | . . 3 ⊢ (𝜑 → (𝐷‘𝑄) = (𝐹‘𝑃)) | |
| 18 | 14, 16, 17 | 3eqtrd 2799 | . 2 ⊢ (𝜑 → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐹‘𝑃)) |
| 19 | 11, 12, 4, 5 | cdlemd 41083 | . 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 1570 ∈ wcel 2145 class class class wbr 5103 ∘ ccom 5659 ‘cfv 6533 lecple 17352 Atomscatm 40139 HLchlt 40226 LHypclh 40860 LTrncltrn 40977 |
| 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 7737 ax-riotaBAD 39829 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-iin 4954 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 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7987 df-2nd 7988 df-undef 8272 df-map 8831 df-proset 18385 df-poset 18404 df-plt 18419 df-lub 18435 df-glb 18436 df-join 18437 df-meet 18438 df-p0 18514 df-p1 18515 df-lat 18523 df-clat 18590 df-oposet 40052 df-ol 40054 df-oml 40055 df-covers 40142 df-ats 40143 df-atl 40174 df-cvlat 40198 df-hlat 40227 df-llines 40374 df-lplanes 40375 df-lvols 40376 df-lines 40377 df-psubsp 40379 df-pmap 40380 df-padd 40672 df-lhyp 40864 df-laut 40865 df-ldil 40980 df-ltrn 40981 df-trl 41035 |
| This theorem is used by: dia2dimlem5 41944 |
| Copyright terms: Public domain | W3C validator |