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 6719

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 6551	. . . 4 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2	1	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝑉 → (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)))
3	2	sbcbidv 3836	. 2 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ [𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴)))
4		sbcfung 6577	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]Fun 𝐹 ↔ Fun ⦋𝑋 / 𝑥⦌𝐹))
5		sbceqg 4410	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]dom 𝐹 = 𝐴 ↔ ⦋𝑋 / 𝑥⦌dom 𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
6		csbdm 5900	. . . . . 6 ⊢ ⦋𝑋 / 𝑥⦌dom 𝐹 = dom ⦋𝑋 / 𝑥⦌𝐹
7	6	eqeq1i 2733	. . . . 5 ⊢ (⦋𝑋 / 𝑥⦌dom 𝐹 = ⦋𝑋 / 𝑥⦌𝐴 ↔ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴)
8	5, 7	bitrdi 287	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]dom 𝐹 = 𝐴 ↔ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
9	4, 8	anbi12d 631	. . 3 ⊢ (𝑋 ∈ 𝑉 → (([𝑋 / 𝑥]Fun 𝐹 ∧ [𝑋 / 𝑥]dom 𝐹 = 𝐴) ↔ (Fun ⦋𝑋 / 𝑥⦌𝐹 ∧ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴)))
10		sbcan 3829	. . 3 ⊢ ([𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ ([𝑋 / 𝑥]Fun 𝐹 ∧ [𝑋 / 𝑥]dom 𝐹 = 𝐴))
11		df-fn 6551	. . 3 ⊢ (⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴 ↔ (Fun ⦋𝑋 / 𝑥⦌𝐹 ∧ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
12	9, 10, 11	3bitr4g 314	. 2 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))
13	3, 12	bitrd 279	1 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1534 ∈ wcel 2099 [wsbc 3776 ⦋csb 3892 dom cdm 5678 Fun wfun 6542 Fn wfn 6543

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pr 5429

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ral 3059 df-rex 3068 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-br 5149 df-opab 5211 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-fun 6550 df-fn 6551

This theorem is referenced by: sbcfg 6720

W3C validator