Theorem sbcfg 5207

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 5063	. . . 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 2919	. 2 |- ( X e. V -> ( [. X / x ]. F : A --> B <-> [. X / x ]. ( F Fn A /\ ran F C_ B ) ) )
4		sbcfng 5206	. . . 4 |- ( X e. V -> ( [. X / x ]. F Fn A <-> [_ X / x ]_ F Fn [_ X / x ]_ A ) )
5		sbcssg 3419	. . . . 5 |- ( X e. V -> ( [. X / x ]. ran F C_ B <-> [_ X / x ]_ ran F C_ [_ X / x ]_ B ) )
6		csbrng 4936	. . . . . 6 |- ( X e. V -> [_ X / x ]_ ran F = ran [_ X / x ]_ F )
7	6	sseq1d 3076	. . . . 5 |- ( X e. V -> ( [_ X / x ]_ ran F C_ [_ X / x ]_ B <-> ran [_ X / x ]_ F C_ [_ X / x ]_ B ) )
8	5, 7	bitrd 187	. . . 4 |- ( X e. V -> ( [. X / x ]. ran F C_ B <-> ran [_ X / x ]_ F C_ [_ X / x ]_ B ) )
9	4, 8	anbi12d 460	. . 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 2903	. . 3 |- ( [. X / x ]. ( F Fn A /\ ran F C_ B ) <-> ( [. X / x ]. F Fn A /\ [. X / x ]. ran F C_ B ) )
11		df-f 5063	. . 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 222	. 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 187	1 |- ( X e. V -> ( [. X / x ]. F : A --> B <-> [_ X / x ]_ F : [_ X / x ]_ A --> [_ X / x ]_ B ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   e. wcel 1448   [.wsbc 2862   [_csb 2955   C_ wss 3021   ran crn 4478   Fn wfn 5054   -->wf 5055

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-sep 3986  ax-pow 4038  ax-pr 4069

This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ral 2380  df-v 2643  df-sbc 2863  df-csb 2956  df-un 3025  df-in 3027  df-ss 3034  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-br 3876  df-opab 3930  df-id 4153  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-fun 5061  df-fn 5062  df-f 5063

This theorem is referenced by: (None)