fvco4i - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fvco4i		Structured version Visualization version GIF version

Theorem fvco4i 6936

Description: Conditions for a composition to be expandable without conditions on the argument. (Contributed by Stefan O'Rear, 31-Mar-2015.)

**Hypotheses**
Ref	Expression
fvco4i.a	⊢ ∅ = (𝐹‘∅)
fvco4i.b	⊢ Fun 𝐺

**Assertion**
Ref	Expression
fvco4i	⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))

**Proof of Theorem fvco4i**
Step	Hyp	Ref	Expression
1		fvco4i.b	. . . 4 ⊢ Fun 𝐺
2		funfn 6523	. . . 4 ⊢ (Fun 𝐺 ↔ 𝐺 Fn dom 𝐺)
3	1, 2	mpbi 230	. . 3 ⊢ 𝐺 Fn dom 𝐺
4		fvco2 6932	. . 3 ⊢ ((𝐺 Fn dom 𝐺 ∧ 𝑋 ∈ dom 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
5	3, 4	mpan 691	. 2 ⊢ (𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
6		fvco4i.a	. . 3 ⊢ ∅ = (𝐹‘∅)
7		dmcoss 5925	. . . . 5 ⊢ dom (𝐹 ∘ 𝐺) ⊆ dom 𝐺
8	7	sseli 3918	. . . 4 ⊢ (𝑋 ∈ dom (𝐹 ∘ 𝐺) → 𝑋 ∈ dom 𝐺)
9		ndmfv 6867	. . . 4 ⊢ (¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺) → ((𝐹 ∘ 𝐺)‘𝑋) = ∅)
10	8, 9	nsyl5 159	. . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = ∅)
11		ndmfv 6867	. . . 4 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐺‘𝑋) = ∅)
12	11	fveq2d 6839	. . 3 ⊢ (¬ 𝑋 ∈ dom 𝐺 → (𝐹‘(𝐺‘𝑋)) = (𝐹‘∅))
13	6, 10, 12	3eqtr4a 2798	. 2 ⊢ (¬ 𝑋 ∈ dom 𝐺 → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
14	5, 13	pm2.61i 182	1 ⊢ ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 = wceq 1542 ∈ wcel 2114 ∅c0 4274 dom cdm 5625 ∘ ccom 5629 Fun wfun 6487 Fn wfn 6488 ‘cfv 6493

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5371

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-fv 6501

This theorem is referenced by: lidlval 21203 rspval 21204