| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ltrncoval | Structured version Visualization version GIF version | ||
| Description: Two ways to express value of translation composition. (Contributed by NM, 31-May-2013.) |
| Ref | Expression |
|---|---|
| ltrnel.l | ⊢ ≤ = (le‘𝐾) |
| ltrnel.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| ltrnel.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| ltrnel.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| ltrncoval | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑃) = (𝐹‘(𝐺‘𝑃))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 2 | simp2r 1219 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → 𝐺 ∈ 𝑇) | |
| 3 | eqid 2763 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 4 | ltrnel.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 5 | ltrnel.t | . . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 6 | 3, 4, 5 | ltrn1o 41447 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:(Base‘𝐾)⟶1-1onto(Base‘𝐾)) |
| 7 | 1, 2, 6 | syl2anc 596 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → 𝐺:(Base‘𝐾)⟶1-1onto(Base‘𝐾)) |
| 8 | f1of 6854 | . . 3 ⊢ (𝐺:(Base‘𝐾)⟶1-1onto(Base‘𝐾) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾)) | |
| 9 | 7, 8 | syl 18 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → 𝐺:(Base‘𝐾)⟶(Base‘𝐾)) |
| 10 | ltrnel.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 11 | 3, 10 | atbase 40612 | . . 3 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) |
| 12 | 11 | 3ad2ant3 1153 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → 𝑃 ∈ (Base‘𝐾)) |
| 13 | fvco3 7016 | . 2 ⊢ ((𝐺:(Base‘𝐾)⟶(Base‘𝐾) ∧ 𝑃 ∈ (Base‘𝐾)) → ((𝐹 ∘ 𝐺)‘𝑃) = (𝐹‘(𝐺‘𝑃))) | |
| 14 | 9, 12, 13 | syl2anc 596 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑃) = (𝐹‘(𝐺‘𝑃))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∘ ccom 5662 ⟶wf 6562 ⟶1-1ontowf1o 6565 ‘cfv 6566 Basecbs 17431 lecple 17479 Atomscatm 40586 HLchlt 40673 LHypclh 41307 LTrncltrn 41424 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 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-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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-map 8887 df-ats 40590 df-laut 41312 df-ldil 41427 df-ltrn 41428 |
| This theorem is used by: cdlemg41 42041 trlcoabs 42044 trlcoabs2N 42045 trlcolem 42049 cdlemg44 42056 cdlemi2 42142 cdlemk2 42155 cdlemk4 42157 cdlemk8 42161 dia2dimlem4 42390 dihjatcclem3 42743 |
| Copyright terms: Public domain | W3C validator |