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 6659

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 6495	. . . 4 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2	1	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝑉 → (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)))
3	2	sbcbidv 3785	. 2 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ [𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴)))
4		sbcfung 6516	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]Fun 𝐹 ↔ Fun ⦋𝑋 / 𝑥⦌𝐹))
5		sbceqg 4347	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]dom 𝐹 = 𝐴 ↔ ⦋𝑋 / 𝑥⦌dom 𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
6		csbdm 5846	. . . . . 6 ⊢ ⦋𝑋 / 𝑥⦌dom 𝐹 = dom ⦋𝑋 / 𝑥⦌𝐹
7	6	eqeq1i 2745	. . . . 5 ⊢ (⦋𝑋 / 𝑥⦌dom 𝐹 = ⦋𝑋 / 𝑥⦌𝐴 ↔ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴)
8	5, 7	bitrdi 288	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]dom 𝐹 = 𝐴 ↔ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
9	4, 8	anbi12d 638	. . 3 ⊢ (𝑋 ∈ 𝑉 → (([𝑋 / 𝑥]Fun 𝐹 ∧ [𝑋 / 𝑥]dom 𝐹 = 𝐴) ↔ (Fun ⦋𝑋 / 𝑥⦌𝐹 ∧ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴)))
10		sbcan 3779	. . 3 ⊢ ([𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ ([𝑋 / 𝑥]Fun 𝐹 ∧ [𝑋 / 𝑥]dom 𝐹 = 𝐴))
11		df-fn 6495	. . 3 ⊢ (⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴 ↔ (Fun ⦋𝑋 / 𝑥⦌𝐹 ∧ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
12	9, 10, 11	3bitr4g 315	. 2 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))
13	3, 12	bitrd 280	1 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 [wsbc 3730 ⦋csb 3838 dom cdm 5625 Fun wfun 6486 Fn wfn 6487

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-pr 5369

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-br 5080 df-opab 5142 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-fun 6494 df-fn 6495

This theorem is referenced by: sbcfg 6660

W3C validator