| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fcompt | GIF version | ||
| Description: Express composition of two functions as a maps-to applying both in sequence. (Contributed by Stefan O'Rear, 5-Oct-2014.) (Proof shortened by Mario Carneiro, 27-Dec-2014.) |
| Ref | Expression |
|---|---|
| fcompt | ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → (𝐴 ∘ 𝐵) = (𝑥 ∈ 𝐶 ↦ (𝐴‘(𝐵‘𝑥)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ffvelcdm 5783 | . . 3 ⊢ ((𝐵:𝐶⟶𝐷 ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷) | |
| 2 | 1 | adantll 476 | . 2 ⊢ (((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) ∧ 𝑥 ∈ 𝐶) → (𝐵‘𝑥) ∈ 𝐷) |
| 3 | ffn 5484 | . . . 4 ⊢ (𝐵:𝐶⟶𝐷 → 𝐵 Fn 𝐶) | |
| 4 | 3 | adantl 277 | . . 3 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 Fn 𝐶) |
| 5 | dffn5im 5694 | . . 3 ⊢ (𝐵 Fn 𝐶 → 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥))) | |
| 6 | 4, 5 | syl 14 | . 2 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐵 = (𝑥 ∈ 𝐶 ↦ (𝐵‘𝑥))) |
| 7 | ffn 5484 | . . . 4 ⊢ (𝐴:𝐷⟶𝐸 → 𝐴 Fn 𝐷) | |
| 8 | 7 | adantr 276 | . . 3 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 Fn 𝐷) |
| 9 | dffn5im 5694 | . . 3 ⊢ (𝐴 Fn 𝐷 → 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦))) | |
| 10 | 8, 9 | syl 14 | . 2 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → 𝐴 = (𝑦 ∈ 𝐷 ↦ (𝐴‘𝑦))) |
| 11 | fveq2 5642 | . 2 ⊢ (𝑦 = (𝐵‘𝑥) → (𝐴‘𝑦) = (𝐴‘(𝐵‘𝑥))) | |
| 12 | 2, 6, 10, 11 | fmptco 5816 | 1 ⊢ ((𝐴:𝐷⟶𝐸 ∧ 𝐵:𝐶⟶𝐷) → (𝐴 ∘ 𝐵) = (𝑥 ∈ 𝐶 ↦ (𝐴‘(𝐵‘𝑥)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2201 ↦ cmpt 4151 ∘ ccom 4731 Fn wfn 5323 ⟶wf 5324 ‘cfv 5328 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2204 ax-ext 2212 ax-sep 4208 ax-pow 4266 ax-pr 4301 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ral 2514 df-rex 2515 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-un 3203 df-in 3205 df-ss 3212 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-fv 5336 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |