| 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 6570 | . . . 4 ⊢ (Fun 𝐺 ↔ 𝐺 Fn dom 𝐺) | |
| 3 | 1, 2 | mpbi 233 | . . 3 ⊢ 𝐺 Fn dom 𝐺 |
| 4 | fvco2 6982 | . . 3 ⊢ ((𝐺 Fn dom 𝐺 ∧ 𝑋 ∈ dom 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) | |
| 5 | 3, 4 | mpan 703 | . 2 ⊢ (𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 6 | fvco4i.a | . . 3 ⊢ ∅ = (𝐹‘∅) | |
| 7 | dmcoss 5967 | . . . . 5 ⊢ dom (𝐹 ∘ 𝐺) ⊆ dom 𝐺 | |
| 8 | 7 | sseli 3934 | . . . 4 ⊢ (𝑋 ∈ dom (𝐹 ∘ 𝐺) → 𝑋 ∈ dom 𝐺) |
| 9 | ndmfv 6917 | . . . 4 ⊢ (¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) | |
| 10 | 8, 9 | nsyl5 160 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) |
| 11 | ndmfv 6917 | . . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐺‘𝑋) = ∅) | |
| 12 | 11 | fveq2d 6889 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐹‘(𝐺‘𝑋)) = (𝐹‘∅)) |
| 13 | 6, 10, 12 | 3eqtr4a 2826 | . 2 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 14 | 5, 13 | pm2.61i 184 | 1 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2146 ∅c0 4286 dom cdm 5663 ∘ ccom 5667 Fun wfun 6534 Fn wfn 6535 ‘cfv 6540 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-fv 6548 |
| This theorem is used by: lidlval 21384 rspval 21385 |
| Copyright terms: Public domain | W3C validator |