Theorem sbcfg 5527

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

Assertion

Ref	Expression
sbcfg	|- ( X e. V -> ( [. X / x ]. F : A --> B <-> [_ X / x ]_ F : [_ X / x ]_ A --> [_ X / x ]_ B ) )

Distinct variable groups:   x, V   x, X

Allowed substitution hints:   A( x)   B( x)   F( x)

Proof of Theorem sbcfg

Step	Hyp	Ref	Expression
1		df-f 5376	. . . 4 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
2	1	a1i 9	. . 3 |- ( X e. V -> ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) ) )
3	2	sbcbidv 3110	. 2 |- ( X e. V -> ( [. X / x ]. F : A --> B <-> [. X / x ]. ( F Fn A /\ ran F C_ B ) ) )
4		sbcfng 5526	. . . 4 |- ( X e. V -> ( [. X / x ]. F Fn A <-> [_ X / x ]_ F Fn [_ X / x ]_ A ) )
5		sbcssg 3633	. . . . 5 |- ( X e. V -> ( [. X / x ]. ran F C_ B <-> [_ X / x ]_ ran F C_ [_ X / x ]_ B ) )
6		csbrng 5244	. . . . . 6 |- ( X e. V -> [_ X / x ]_ ran F = ran [_ X / x ]_ F )
7	6	sseq1d 3277	. . . . 5 |- ( X e. V -> ( [_ X / x ]_ ran F C_ [_ X / x ]_ B <-> ran [_ X / x ]_ F C_ [_ X / x ]_ B ) )
8	5, 7	bitrd 188	. . . 4 |- ( X e. V -> ( [. X / x ]. ran F C_ B <-> ran [_ X / x ]_ F C_ [_ X / x ]_ B ) )
9	4, 8	anbi12d 477	. . 3 |- ( X e. V -> ( ( [. X / x ]. F Fn A /\ [. X / x ]. ran F C_ B ) <-> ( [_ X / x ]_ F Fn [_ X / x ]_ A /\ ran [_ X / x ]_ F C_ [_ X / x ]_ B ) ) )
10		sbcan 3094	. . 3 |- ( [. X / x ]. ( F Fn A /\ ran F C_ B ) <-> ( [. X / x ]. F Fn A /\ [. X / x ]. ran F C_ B ) )
11		df-f 5376	. . 3 |- ( [_ X / x ]_ F : [_ X / x ]_ A --> [_ X / x ]_ B <-> ( [_ X / x ]_ F Fn [_ X / x ]_ A /\ ran [_ X / x ]_ F C_ [_ X / x ]_ B ) )
12	9, 10, 11	3bitr4g 223	. 2 |- ( X e. V -> ( [. X / x ]. ( F Fn A /\ ran F C_ B ) <-> [_ X / x ]_ F : [_ X / x ]_ A --> [_ X / x ]_ B ) )
13	3, 12	bitrd 188	1 |- ( X e. V -> ( [. X / x ]. F : A --> B <-> [_ X / x ]_ F : [_ X / x ]_ A --> [_ X / x ]_ B ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2209   [.wsbc 3051   [_csb 3147   C_ wss 3220   ran crn 4770   Fn wfn 5367   -->wf 5368

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-id 4433  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-fun 5374  df-fn 5375  df-f 5376

This theorem is referenced by:  csbwrdg  11312  ctiunctlemf  13307