| 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 6551 | . . . 4 ⊢ (Fun 𝐺 ↔ 𝐺 Fn dom 𝐺) | |
| 3 | 1, 2 | mpbi 232 | . . 3 ⊢ 𝐺 Fn dom 𝐺 |
| 4 | fvco2 6964 | . . 3 ⊢ ((𝐺 Fn dom 𝐺 ∧ 𝑋 ∈ dom 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) | |
| 5 | 3, 4 | mpan 700 | . 2 ⊢ (𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 6 | fvco4i.a | . . 3 ⊢ ∅ = (𝐹‘∅) | |
| 7 | dmcoss 5951 | . . . . 5 ⊢ dom (𝐹 ∘ 𝐺) ⊆ dom 𝐺 | |
| 8 | 7 | sseli 3932 | . . . 4 ⊢ (𝑋 ∈ dom (𝐹 ∘ 𝐺) → 𝑋 ∈ dom 𝐺) |
| 9 | ndmfv 6899 | . . . 4 ⊢ (¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) | |
| 10 | 8, 9 | nsyl5 159 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) |
| 11 | ndmfv 6899 | . . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐺‘𝑋) = ∅) | |
| 12 | 11 | fveq2d 6871 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐹‘(𝐺‘𝑋)) = (𝐹‘∅)) |
| 13 | 6, 10, 12 | 3eqtr4a 2823 | . 2 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 14 | 5, 13 | pm2.61i 183 | 1 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1560 ∈ wcel 2142 ∅c0 4285 dom cdm 5647 ∘ ccom 5651 Fun wfun 6515 Fn wfn 6516 ‘cfv 6521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-fv 6529 |
| This theorem is referenced by: lidlval 21277 rspval 21278 |
| Copyright terms: Public domain | W3C validator |