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

Theorem sbcfng 5405
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 5261 . . . 4  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
21a1i 9 . . 3  |-  ( X  e.  V  ->  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) ) )
32sbcbidv 3048 . 2  |-  ( X  e.  V  ->  ( [. X  /  x ]. F  Fn  A  <->  [. X  /  x ]. ( Fun  F  /\  dom  F  =  A ) ) )
4 sbcfung 5282 . . . 4  |-  ( X  e.  V  ->  ( [. X  /  x ]. Fun  F  <->  Fun  [_ X  /  x ]_ F ) )
5 sbceqg 3100 . . . . 5  |-  ( X  e.  V  ->  ( [. X  /  x ]. dom  F  =  A  <->  [_ X  /  x ]_ dom  F  =  [_ X  /  x ]_ A
) )
6 csbdmg 4860 . . . . . 6  |-  ( X  e.  V  ->  [_ X  /  x ]_ dom  F  =  dom  [_ X  /  x ]_ F )
76eqeq1d 2205 . . . . 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 3032 . . 3  |-  ( [. X  /  x ]. ( Fun  F  /\  dom  F  =  A )  <->  ( [. X  /  x ]. Fun  F  /\  [. X  /  x ]. dom  F  =  A ) )
11 df-fn 5261 . . 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 1364    e. wcel 2167   [.wsbc 2989   [_csb 3084   dom cdm 4663   Fun wfun 5252    Fn wfn 5253
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-id 4328  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-fun 5260  df-fn 5261
This theorem is referenced by:  sbcfg  5406
  Copyright terms: Public domain W3C validator