| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fvco4i | Structured version Visualization version GIF version | ||
| Description: Conditions for a composition to be expandable without conditions on the argument. (Contributed by Stefan O'Rear, 31-Mar-2015.) |
| Ref | Expression |
|---|---|
| fvco4i.a | ⊢ ∅ = (𝐹‘∅) |
| fvco4i.b | ⊢ Fun 𝐺 |
| Ref | Expression |
|---|---|
| fvco4i | ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvco4i.b | . . . 4 ⊢ Fun 𝐺 | |
| 2 | funfn 6515 | . . . 4 ⊢ (Fun 𝐺 ↔ 𝐺 Fn dom 𝐺) | |
| 3 | 1, 2 | mpbi 231 | . . 3 ⊢ 𝐺 Fn dom 𝐺 |
| 4 | fvco2 6924 | . . 3 ⊢ ((𝐺 Fn dom 𝐺 ∧ 𝑋 ∈ dom 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) | |
| 5 | 3, 4 | mpan 696 | . 2 ⊢ (𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 6 | fvco4i.a | . . 3 ⊢ ∅ = (𝐹‘∅) | |
| 7 | dmcoss 5917 | . . . . 5 ⊢ dom (𝐹 ∘ 𝐺) ⊆ dom 𝐺 | |
| 8 | 7 | sseli 3911 | . . . 4 ⊢ (𝑋 ∈ dom (𝐹 ∘ 𝐺) → 𝑋 ∈ dom 𝐺) |
| 9 | ndmfv 6859 | . . . 4 ⊢ (¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) | |
| 10 | 8, 9 | nsyl5 159 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) |
| 11 | ndmfv 6859 | . . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐺‘𝑋) = ∅) | |
| 12 | 11 | fveq2d 6831 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐹‘(𝐺‘𝑋)) = (𝐹‘∅)) |
| 13 | 6, 10, 12 | 3eqtr4a 2800 | . 2 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 14 | 5, 13 | pm2.61i 183 | 1 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1547 ∈ wcel 2119 ∅c0 4261 dom cdm 5618 ∘ ccom 5622 Fun wfun 6479 Fn wfn 6480 ‘cfv 6485 |
| 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-sep 5218 ax-nul 5228 ax-pr 5362 |
| 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-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 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-fv 6493 |
| This theorem is referenced by: lidlval 21203 rspval 21204 |
| Copyright terms: Public domain | W3C validator |