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 6520

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 6361	. . . 4 ⊢ (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴))
2	1	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝑉 → (𝐹 Fn 𝐴 ↔ (Fun 𝐹 ∧ dom 𝐹 = 𝐴)))
3	2	sbcbidv 3741	. 2 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ [𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴)))
4		sbcfung 6382	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]Fun 𝐹 ↔ Fun ⦋𝑋 / 𝑥⦌𝐹))
5		sbceqg 4310	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]dom 𝐹 = 𝐴 ↔ ⦋𝑋 / 𝑥⦌dom 𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
6		csbdm 5751	. . . . . 6 ⊢ ⦋𝑋 / 𝑥⦌dom 𝐹 = dom ⦋𝑋 / 𝑥⦌𝐹
7	6	eqeq1i 2741	. . . . 5 ⊢ (⦋𝑋 / 𝑥⦌dom 𝐹 = ⦋𝑋 / 𝑥⦌𝐴 ↔ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴)
8	5, 7	bitrdi 290	. . . 4 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]dom 𝐹 = 𝐴 ↔ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
9	4, 8	anbi12d 634	. . 3 ⊢ (𝑋 ∈ 𝑉 → (([𝑋 / 𝑥]Fun 𝐹 ∧ [𝑋 / 𝑥]dom 𝐹 = 𝐴) ↔ (Fun ⦋𝑋 / 𝑥⦌𝐹 ∧ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴)))
10		sbcan 3735	. . 3 ⊢ ([𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ ([𝑋 / 𝑥]Fun 𝐹 ∧ [𝑋 / 𝑥]dom 𝐹 = 𝐴))
11		df-fn 6361	. . 3 ⊢ (⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴 ↔ (Fun ⦋𝑋 / 𝑥⦌𝐹 ∧ dom ⦋𝑋 / 𝑥⦌𝐹 = ⦋𝑋 / 𝑥⦌𝐴))
12	9, 10, 11	3bitr4g 317	. 2 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥](Fun 𝐹 ∧ dom 𝐹 = 𝐴) ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))
13	3, 12	bitrd 282	1 ⊢ (𝑋 ∈ 𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴 ↔ ⦋𝑋 / 𝑥⦌𝐹 Fn ⦋𝑋 / 𝑥⦌𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∈ wcel 2112 [wsbc 3683 ⦋csb 3798 dom cdm 5536 Fun wfun 6352 Fn wfn 6353

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pr 5307

This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ral 3056 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-br 5040 df-opab 5102 df-id 5440 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-fun 6360 df-fn 6361

This theorem is referenced by: sbcfg 6521

W3C validator