![]() |
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 5918 | . . . 4 ⊢ (Fun 𝐺 ↔ 𝐺 Fn dom 𝐺) | |
3 | 1, 2 | mpbi 220 | . . 3 ⊢ 𝐺 Fn dom 𝐺 |
4 | fvco2 6273 | . . 3 ⊢ ((𝐺 Fn dom 𝐺 ∧ 𝑋 ∈ dom 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) | |
5 | 3, 4 | mpan 706 | . 2 ⊢ (𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
6 | fvco4i.a | . . 3 ⊢ ∅ = (𝐹‘∅) | |
7 | dmcoss 5385 | . . . . . 6 ⊢ dom (𝐹 ∘ 𝐺) ⊆ dom 𝐺 | |
8 | 7 | sseli 3599 | . . . . 5 ⊢ (𝑋 ∈ dom (𝐹 ∘ 𝐺) → 𝑋 ∈ dom 𝐺) |
9 | 8 | con3i 150 | . . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺)) |
10 | ndmfv 6218 | . . . 4 ⊢ (¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) | |
11 | 9, 10 | syl 17 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = ∅) |
12 | ndmfv 6218 | . . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐺‘𝑋) = ∅) | |
13 | 12 | fveq2d 6195 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐹‘(𝐺‘𝑋)) = (𝐹‘∅)) |
14 | 6, 11, 13 | 3eqtr4a 2682 | . 2 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
15 | 5, 14 | pm2.61i 176 | 1 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 = wceq 1483 ∈ wcel 1990 ∅c0 3915 dom cdm 5114 ∘ ccom 5118 Fun wfun 5882 Fn wfn 5883 ‘cfv 5888 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-fv 5896 |
This theorem is referenced by: lidlval 19192 rspval 19193 |
Copyright terms: Public domain | W3C validator |