sbcfng - Metamath Proof Explorer

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

Theorem sbcfng 6683

Description: Distribute proper substitution through the function predicate with a domain. (Contributed by Alexander van der Vekens, 15-Jul-2018.)

**Assertion**
Ref	Expression
sbcfng	⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))

Distinct variable groups: 𝑥,𝑉 𝑥,𝑋 Allowed substitution hints: 𝐴(𝑥) 𝐹(𝑥)

**Proof of Theorem sbcfng**
Step	Hyp	Ref	Expression
1		df-fn 6519	. . . 4 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2	1	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝑉 → (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)))
3	2	sbcbidv 3797	. 2 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ [𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴)))
4		sbcfung 6540	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]Fun 𝐹 ↔ Fun ⦋𝑋 / 𝑥⦌𝐹))
5		sbceqg 4363	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]dom 𝐹 = 𝐴 ↔ ⦋𝑋 / 𝑥⦌dom 𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
6		csbdm 5869	. . . . . 6 ⊢ ⦋𝑋 / 𝑥⦌dom 𝐹 = dom ⦋𝑋 / 𝑥⦌𝐹
7	6	eqeq1i 2766	. . . . 5 ⊢ (⦋𝑋 / 𝑥⦌dom 𝐹 = ⦋𝑋 / 𝑥⦌𝐴 ↔ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴)
8	5, 7	bitrdi 289	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]dom 𝐹 = 𝐴 ↔ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
9	4, 8	anbi12d 641	. . 3 ⊢ (𝑋 ∈ 𝑉 → (([𝑋 / 𝑥]Fun 𝐹 ∧ [𝑋 / 𝑥]dom 𝐹 = 𝐴) ↔ (Fun ⦋𝑋 / 𝑥⦌𝐹 ∧ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴)))
10		sbcan 3791	. . 3 ⊢ ([𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ ([𝑋 / 𝑥]Fun 𝐹 ∧ [𝑋 / 𝑥]dom 𝐹 = 𝐴))
11		df-fn 6519	. . 3 ⊢ (⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴 ↔ (Fun ⦋𝑋 / 𝑥⦌𝐹 ∧ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
12	9, 10, 11	3bitr4g 316	. 2 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))
13	3, 12	bitrd 281	1 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 [wsbc 3742 ⦋csb 3850 dom cdm 5643 Fun wfun 6510 Fn wfn 6511

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-pr 5387

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-br 5098 df-opab 5160 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-fun 6518 df-fn 6519

This theorem is referenced by: sbcfg 6684

W3C validator