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

Theorem sbcfng 5265
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 5121 . . . 4  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
21a1i 9 . . 3  |-  ( X  e.  V  ->  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) ) )
32sbcbidv 2962 . 2  |-  ( X  e.  V  ->  ( [. X  /  x ]. F  Fn  A  <->  [. X  /  x ]. ( Fun  F  /\  dom  F  =  A ) ) )
4 sbcfung 5142 . . . 4  |-  ( X  e.  V  ->  ( [. X  /  x ]. Fun  F  <->  Fun  [_ X  /  x ]_ F ) )
5 sbceqg 3013 . . . . 5  |-  ( X  e.  V  ->  ( [. X  /  x ]. dom  F  =  A  <->  [_ X  /  x ]_ dom  F  =  [_ X  /  x ]_ A
) )
6 csbdmg 4728 . . . . . 6  |-  ( X  e.  V  ->  [_ X  /  x ]_ dom  F  =  dom  [_ X  /  x ]_ F )
76eqeq1d 2146 . . . . 5  |-  ( X  e.  V  ->  ( [_ X  /  x ]_ dom  F  =  [_ X  /  x ]_ A  <->  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
85, 7bitrd 187 . . . 4  |-  ( X  e.  V  ->  ( [. X  /  x ]. dom  F  =  A  <->  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
94, 8anbi12d 464 . . 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 2946 . . 3  |-  ( [. X  /  x ]. ( Fun  F  /\  dom  F  =  A )  <->  ( [. X  /  x ]. Fun  F  /\  [. X  /  x ]. dom  F  =  A ) )
11 df-fn 5121 . . 3  |-  ( [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A  <->  ( Fun  [_ X  /  x ]_ F  /\  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
129, 10, 113bitr4g 222 . 2  |-  ( X  e.  V  ->  ( [. X  /  x ]. ( Fun  F  /\  dom  F  =  A )  <->  [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A ) )
133, 12bitrd 187 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 103    <-> wb 104    = wceq 1331    e. wcel 1480   [.wsbc 2904   [_csb 2998   dom cdm 4534   Fun wfun 5112    Fn wfn 5113
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-v 2683  df-sbc 2905  df-csb 2999  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-id 4210  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-fun 5120  df-fn 5121
This theorem is referenced by:  sbcfg  5266
  Copyright terms: Public domain W3C validator