| 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 41913. 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 41555 | . . 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 40981 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐷 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐷‘(𝐺‘𝑃))) |
| 14 | 1, 2, 3, 10, 13 | syl121anc 1402 | . . 3 ⊢ (𝜑 → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐷‘(𝐺‘𝑃))) |
| 15 | dia2dimlem4.gv | . . . 4 ⊢ (𝜑 → (𝐺‘𝑃) = 𝑄) | |
| 16 | 15 | fveq2d 6889 | . . 3 ⊢ (𝜑 → (𝐷‘(𝐺‘𝑃)) = (𝐷‘𝑄)) |
| 17 | dia2dimlem4.dv | . . 3 ⊢ (𝜑 → (𝐷‘𝑄) = (𝐹‘𝑃)) | |
| 18 | 14, 16, 17 | 3eqtrd 2804 | . 2 ⊢ (𝜑 → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐹‘𝑃)) |
| 19 | 11, 12, 4, 5 | cdlemd 41043 | . 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 2146 class class class wbr 5111 ∘ ccom 5667 ‘cfv 6540 lecple 17343 Atomscatm 40099 HLchlt 40186 LHypclh 40820 LTrncltrn 40937 |
| 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 ax-riotaBAD 39789 |
| 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 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-iin 4961 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-mpo 7424 df-1st 7992 df-2nd 7993 df-undef 8275 df-map 8832 df-proset 18376 df-poset 18395 df-plt 18410 df-lub 18426 df-glb 18427 df-join 18428 df-meet 18429 df-p0 18505 df-p1 18506 df-lat 18514 df-clat 18581 df-oposet 40012 df-ol 40014 df-oml 40015 df-covers 40102 df-ats 40103 df-atl 40134 df-cvlat 40158 df-hlat 40187 df-llines 40334 df-lplanes 40335 df-lvols 40336 df-lines 40337 df-psubsp 40339 df-pmap 40340 df-padd 40632 df-lhyp 40824 df-laut 40825 df-ldil 40940 df-ltrn 40941 df-trl 40995 |
| This theorem is used by: dia2dimlem5 41904 |
| Copyright terms: Public domain | W3C validator |