ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sbcfng Unicode version

Theorem sbcfng 5477
Description: Distribute proper substitution through the function predicate with a domain. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
Assertion
Ref Expression
sbcfng  |-  ( X  e.  V  ->  ( [. X  /  x ]. F  Fn  A  <->  [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A ) )
Distinct variable groups:    x, V    x, X
Allowed substitution hints:    A( x)    F( x)

Proof of Theorem sbcfng
StepHypRef Expression
1 df-fn 5327 . . . 4  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
21a1i 9 . . 3  |-  ( X  e.  V  ->  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) ) )
32sbcbidv 3088 . 2  |-  ( X  e.  V  ->  ( [. X  /  x ]. F  Fn  A  <->  [. X  /  x ]. ( Fun  F  /\  dom  F  =  A ) ) )
4 sbcfung 5348 . . . 4  |-  ( X  e.  V  ->  ( [. X  /  x ]. Fun  F  <->  Fun  [_ X  /  x ]_ F ) )
5 sbceqg 3141 . . . . 5  |-  ( X  e.  V  ->  ( [. X  /  x ]. dom  F  =  A  <->  [_ X  /  x ]_ dom  F  =  [_ X  /  x ]_ A
) )
6 csbdmg 4923 . . . . . 6  |-  ( X  e.  V  ->  [_ X  /  x ]_ dom  F  =  dom  [_ X  /  x ]_ F )
76eqeq1d 2238 . . . . 5  |-  ( X  e.  V  ->  ( [_ X  /  x ]_ dom  F  =  [_ X  /  x ]_ A  <->  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
85, 7bitrd 188 . . . 4  |-  ( X  e.  V  ->  ( [. X  /  x ]. dom  F  =  A  <->  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
94, 8anbi12d 473 . . 3  |-  ( X  e.  V  ->  (
( [. X  /  x ]. Fun  F  /\  [. X  /  x ]. dom  F  =  A )  <->  ( Fun  [_ X  /  x ]_ F  /\  dom  [_ X  /  x ]_ F  = 
[_ X  /  x ]_ A ) ) )
10 sbcan 3072 . . 3  |-  ( [. X  /  x ]. ( Fun  F  /\  dom  F  =  A )  <->  ( [. X  /  x ]. Fun  F  /\  [. X  /  x ]. dom  F  =  A ) )
11 df-fn 5327 . . 3  |-  ( [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A  <->  ( Fun  [_ X  /  x ]_ F  /\  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
129, 10, 113bitr4g 223 . 2  |-  ( X  e.  V  ->  ( [. X  /  x ]. ( Fun  F  /\  dom  F  =  A )  <->  [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A ) )
133, 12bitrd 188 1  |-  ( X  e.  V  ->  ( [. X  /  x ]. F  Fn  A  <->  [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   [.wsbc 3029   [_csb 3125   dom cdm 4723   Fun wfun 5318    Fn wfn 5319
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-br 4087  df-opab 4149  df-id 4388  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-fun 5326  df-fn 5327
This theorem is referenced by:  sbcfg  5478
  Copyright terms: Public domain W3C validator