| 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 6520 | . . . 4 ⊢ (Fun 𝐺 ↔ 𝐺 Fn dom 𝐺) | |
| 3 | 1, 2 | mpbi 230 | . . 3 ⊢ 𝐺 Fn dom 𝐺 |
| 4 | fvco2 6929 | . . 3 ⊢ ((𝐺 Fn dom 𝐺 ∧ 𝑋 ∈ dom 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) | |
| 5 | 3, 4 | mpan 690 | . 2 ⊢ (𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 6 | fvco4i.a | . . 3 ⊢ ∅ = (𝐹‘∅) | |
| 7 | dmcoss 5922 | . . . . 5 ⊢ dom (𝐹 ∘ 𝐺) ⊆ dom 𝐺 | |
| 8 | 7 | sseli 3927 | . . . 4 ⊢ (𝑋 ∈ dom (𝐹 ∘ 𝐺) → 𝑋 ∈ dom 𝐺) |
| 9 | ndmfv 6864 | . . . 4 ⊢ (¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) | |
| 10 | 8, 9 | nsyl5 159 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) |
| 11 | ndmfv 6864 | . . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐺‘𝑋) = ∅) | |
| 12 | 11 | fveq2d 6836 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐹‘(𝐺‘𝑋)) = (𝐹‘∅)) |
| 13 | 6, 10, 12 | 3eqtr4a 2795 | . 2 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 14 | 5, 13 | pm2.61i 182 | 1 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1541 ∈ wcel 2113 ∅c0 4283 dom cdm 5622 ∘ ccom 5626 Fun wfun 6484 Fn wfn 6485 ‘cfv 6490 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-fv 6498 |
| This theorem is referenced by: lidlval 21163 rspval 21164 |
| Copyright terms: Public domain | W3C validator |