| 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 1142 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 2 | simp2r 1207 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐺 ∈ 𝑇) | |
| 3 | cdlemg46.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 4 | cdlemg46.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 5 | cdlemg46.t | . . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 6 | 3, 4, 5 | ltrn1o 40616 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → 𝐺:𝐵–1-1-onto→𝐵) |
| 7 | 1, 2, 6 | syl2anc 590 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐺:𝐵–1-1-onto→𝐵) |
| 8 | f1of 6767 | . . . 4 ⊢ (𝐺:𝐵–1-1-onto→𝐵 → 𝐺:𝐵⟶𝐵) | |
| 9 | 7, 8 | syl 17 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐺:𝐵⟶𝐵) |
| 10 | fcoi1 6701 | . . 3 ⊢ (𝐺:𝐵⟶𝐵 → (𝐺 ∘ ( I ↾ 𝐵)) = 𝐺) | |
| 11 | 9, 10 | syl 17 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐺 ∘ ( I ↾ 𝐵)) = 𝐺) |
| 12 | simp3 1144 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → 𝐹 = ( I ↾ 𝐵)) | |
| 13 | 12 | coeq2d 5804 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐺 ∘ 𝐹) = (𝐺 ∘ ( I ↾ 𝐵))) |
| 14 | 12 | coeq1d 5803 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹 ∘ 𝐺) = (( I ↾ 𝐵) ∘ 𝐺)) |
| 15 | fcoi2 6702 | . . . 4 ⊢ (𝐺:𝐵⟶𝐵 → (( I ↾ 𝐵) ∘ 𝐺) = 𝐺) | |
| 16 | 9, 15 | syl 17 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (( I ↾ 𝐵) ∘ 𝐺) = 𝐺) |
| 17 | 14, 16 | eqtrd 2774 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹 ∘ 𝐺) = 𝐺) |
| 18 | 11, 13, 17 | 3eqtr4rd 2785 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹 ∘ 𝐺) = (𝐺 ∘ 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 I cid 5512 ↾ cres 5620 ∘ ccom 5622 ⟶wf 6481 –1-1-onto→wf1o 6484 ‘cfv 6485 Basecbs 17170 HLchlt 39842 LHypclh 40476 LTrncltrn 40593 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 df-map 8765 df-laut 40481 df-ldil 40596 df-ltrn 40597 |
| This theorem is referenced by: ltrncom 41230 |
| Copyright terms: Public domain | W3C validator |