| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2fvcoidd | Structured version Visualization version GIF version | ||
| Description: Show that the composition of two functions is the identity function by applying both functions to each value of the domain of the first function. (Contributed by AV, 15-Dec-2019.) |
| Ref | Expression |
|---|---|
| 2fvcoidd.f | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
| 2fvcoidd.g | ⊢ (𝜑 → 𝐺:𝐵⟶𝐴) |
| 2fvcoidd.i | ⊢ (𝜑 → ∀𝑎 ∈ 𝐴 (𝐺‘(𝐹‘𝑎)) = 𝑎) |
| Ref | Expression |
|---|---|
| 2fvcoidd | ⊢ (𝜑 → (𝐺 ∘ 𝐹) = ( I ↾ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2fvcoidd.g | . . 3 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴) | |
| 2 | 2fvcoidd.f | . . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
| 3 | fcompt 7127 | . . 3 ⊢ ((𝐺:𝐵⟶𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐺 ∘ 𝐹) = (𝑥 ∈ 𝐴 ↦ (𝐺‘(𝐹‘𝑥)))) | |
| 4 | 1, 2, 3 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = (𝑥 ∈ 𝐴 ↦ (𝐺‘(𝐹‘𝑥)))) |
| 5 | 2fvcoidd.i | . . . . . 6 ⊢ (𝜑 → ∀𝑎 ∈ 𝐴 (𝐺‘(𝐹‘𝑎)) = 𝑎) | |
| 6 | 2fveq3 6883 | . . . . . . . 8 ⊢ (𝑎 = 𝑥 → (𝐺‘(𝐹‘𝑎)) = (𝐺‘(𝐹‘𝑥))) | |
| 7 | id 23 | . . . . . . . 8 ⊢ (𝑎 = 𝑥 → 𝑎 = 𝑥) | |
| 8 | 6, 7 | eqeq12d 2776 | . . . . . . 7 ⊢ (𝑎 = 𝑥 → ((𝐺‘(𝐹‘𝑎)) = 𝑎 ↔ (𝐺‘(𝐹‘𝑥)) = 𝑥)) |
| 9 | 8 | rspccv 3573 | . . . . . 6 ⊢ (∀𝑎 ∈ 𝐴 (𝐺‘(𝐹‘𝑎)) = 𝑎 → (𝑥 ∈ 𝐴 → (𝐺‘(𝐹‘𝑥)) = 𝑥)) |
| 10 | 5, 9 | syl 18 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (𝐺‘(𝐹‘𝑥)) = 𝑥)) |
| 11 | 10 | imp 412 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘(𝐹‘𝑥)) = 𝑥) |
| 12 | 11 | mpteq2dva 5198 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐺‘(𝐹‘𝑥))) = (𝑥 ∈ 𝐴 ↦ 𝑥)) |
| 13 | mptresid 6047 | . . 3 ⊢ ( I ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝑥) | |
| 14 | 12, 13 | eqtr4di 2813 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐺‘(𝐹‘𝑥))) = ( I ↾ 𝐴)) |
| 15 | 4, 14 | eqtrd 2795 | 1 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = ( I ↾ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ↦ cmpt 5186 I cid 5549 ↾ cres 5657 ∘ ccom 5659 ⟶wf 6529 ‘cfv 6533 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 |
| This theorem is used by: 2fvidf1od 7299 2fvidinvd 7300 |
| Copyright terms: Public domain | W3C validator |