| 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 41541. 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 41183 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐷 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐷 ∘ 𝐺) ∈ 𝑇) |
| 7 | 1, 2, 3, 6 | syl3anc 1374 | . 2 ⊢ (𝜑 → (𝐷 ∘ 𝐺) ∈ 𝑇) |
| 8 | dia2dimlem4.f | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑇) | |
| 9 | dia2dimlem4.p | . 2 ⊢ (𝜑 → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
| 10 | 9 | simpld 494 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ 𝐴) |
| 11 | dia2dimlem4.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 12 | dia2dimlem4.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 13 | 11, 12, 4, 5 | ltrncoval 40609 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐷 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐷‘(𝐺‘𝑃))) |
| 14 | 1, 2, 3, 10, 13 | syl121anc 1378 | . . 3 ⊢ (𝜑 → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐷‘(𝐺‘𝑃))) |
| 15 | dia2dimlem4.gv | . . . 4 ⊢ (𝜑 → (𝐺‘𝑃) = 𝑄) | |
| 16 | 15 | fveq2d 6840 | . . 3 ⊢ (𝜑 → (𝐷‘(𝐺‘𝑃)) = (𝐷‘𝑄)) |
| 17 | dia2dimlem4.dv | . . 3 ⊢ (𝜑 → (𝐷‘𝑄) = (𝐹‘𝑃)) | |
| 18 | 14, 16, 17 | 3eqtrd 2776 | . 2 ⊢ (𝜑 → ((𝐷 ∘ 𝐺)‘𝑃) = (𝐹‘𝑃)) |
| 19 | 11, 12, 4, 5 | cdlemd 40671 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐷 ∘ 𝐺) ∈ 𝑇 ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ ((𝐷 ∘ 𝐺)‘𝑃) = (𝐹‘𝑃)) → (𝐷 ∘ 𝐺) = 𝐹) |
| 20 | 1, 7, 8, 9, 18, 19 | syl311anc 1387 | 1 ⊢ (𝜑 → (𝐷 ∘ 𝐺) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ∘ ccom 5630 ‘cfv 6494 lecple 17222 Atomscatm 39727 HLchlt 39814 LHypclh 40448 LTrncltrn 40565 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-riotaBAD 39417 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5521 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-1st 7937 df-2nd 7938 df-undef 8218 df-map 8770 df-proset 18255 df-poset 18274 df-plt 18289 df-lub 18305 df-glb 18306 df-join 18307 df-meet 18308 df-p0 18384 df-p1 18385 df-lat 18393 df-clat 18460 df-oposet 39640 df-ol 39642 df-oml 39643 df-covers 39730 df-ats 39731 df-atl 39762 df-cvlat 39786 df-hlat 39815 df-llines 39962 df-lplanes 39963 df-lvols 39964 df-lines 39965 df-psubsp 39967 df-pmap 39968 df-padd 40260 df-lhyp 40452 df-laut 40453 df-ldil 40568 df-ltrn 40569 df-trl 40623 |
| This theorem is referenced by: dia2dimlem5 41532 |
| Copyright terms: Public domain | W3C validator |