| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemg47a | Structured version Visualization version GIF version | ||
| Description: TODO: fix comment. TODO: Use this above in place of (𝐹‘𝑃) = 𝑃 antecedents? (Contributed by NM, 5-Jun-2013.) |
| Ref | Expression |
|---|---|
| cdlemg46.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemg46.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemg46.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| cdlemg47a | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹 ∘ 𝐺) = (𝐺 ∘ 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1137 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 2 | simp2r 1202 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐺 ∈ 𝑇) | |
| 3 | cdlemg46.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 4 | cdlemg46.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 5 | cdlemg46.t | . . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 6 | 3, 4, 5 | ltrn1o 40587 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:𝐵–1-1-onto→𝐵) |
| 7 | 1, 2, 6 | syl2anc 585 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐺:𝐵–1-1-onto→𝐵) |
| 8 | f1of 6775 | . . . 4 ⊢ (𝐺:𝐵–1-1-onto→𝐵 → 𝐺:𝐵⟶𝐵) | |
| 9 | 7, 8 | syl 17 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐺:𝐵⟶𝐵) |
| 10 | fcoi1 6709 | . . 3 ⊢ (𝐺:𝐵⟶𝐵 → (𝐺 ∘ ( I ↾ 𝐵)) = 𝐺) | |
| 11 | 9, 10 | syl 17 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐺 ∘ ( I ↾ 𝐵)) = 𝐺) |
| 12 | simp3 1139 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐹 = ( I ↾ 𝐵)) | |
| 13 | 12 | coeq2d 5812 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐺 ∘ 𝐹) = (𝐺 ∘ ( I ↾ 𝐵))) |
| 14 | 12 | coeq1d 5811 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹 ∘ 𝐺) = (( I ↾ 𝐵) ∘ 𝐺)) |
| 15 | fcoi2 6710 | . . . 4 ⊢ (𝐺:𝐵⟶𝐵 → (( I ↾ 𝐵) ∘ 𝐺) = 𝐺) | |
| 16 | 9, 15 | syl 17 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (( I ↾ 𝐵) ∘ 𝐺) = 𝐺) |
| 17 | 14, 16 | eqtrd 2772 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹 ∘ 𝐺) = 𝐺) |
| 18 | 11, 13, 17 | 3eqtr4rd 2783 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹 ∘ 𝐺) = (𝐺 ∘ 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 I cid 5519 ↾ cres 5627 ∘ ccom 5629 ⟶wf 6489 –1-1-onto→wf1o 6492 ‘cfv 6493 Basecbs 17173 HLchlt 39813 LHypclh 40447 LTrncltrn 40564 |
| 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 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 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-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-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7364 df-oprab 7365 df-mpo 7366 df-map 8769 df-laut 40452 df-ldil 40567 df-ltrn 40568 |
| This theorem is referenced by: ltrncom 41201 |
| Copyright terms: Public domain | W3C validator |