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

Theorem fununfun 5424
Description: If the union of classes is a function, the classes itselves are functions. (Contributed by AV, 18-Jul-2019.)
Assertion
Ref Expression
fununfun  |-  ( Fun  ( F  u.  G
)  ->  ( Fun  F  /\  Fun  G ) )

Proof of Theorem fununfun
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 funrel 5394 . . 3  |-  ( Fun  ( F  u.  G
)  ->  Rel  ( F  u.  G ) )
2 relun 4894 . . 3  |-  ( Rel  ( F  u.  G
)  <->  ( Rel  F  /\  Rel  G ) )
31, 2sylib 122 . 2  |-  ( Fun  ( F  u.  G
)  ->  ( Rel  F  /\  Rel  G ) )
4 simpl 109 . . . . 5  |-  ( ( Rel  F  /\  Rel  G )  ->  Rel  F )
5 fununmo 5423 . . . . . 6  |-  ( Fun  ( F  u.  G
)  ->  E* y  x F y )
65alrimiv 1927 . . . . 5  |-  ( Fun  ( F  u.  G
)  ->  A. x E* y  x F
y )
74, 6anim12i 338 . . . 4  |-  ( ( ( Rel  F  /\  Rel  G )  /\  Fun  ( F  u.  G
) )  ->  ( Rel  F  /\  A. x E* y  x F
y ) )
8 dffun6 5391 . . . 4  |-  ( Fun 
F  <->  ( Rel  F  /\  A. x E* y  x F y ) )
97, 8sylibr 134 . . 3  |-  ( ( ( Rel  F  /\  Rel  G )  /\  Fun  ( F  u.  G
) )  ->  Fun  F )
10 simpr 110 . . . . 5  |-  ( ( Rel  F  /\  Rel  G )  ->  Rel  G )
11 uncom 3373 . . . . . . . 8  |-  ( F  u.  G )  =  ( G  u.  F
)
1211funeqi 5398 . . . . . . 7  |-  ( Fun  ( F  u.  G
)  <->  Fun  ( G  u.  F ) )
13 fununmo 5423 . . . . . . 7  |-  ( Fun  ( G  u.  F
)  ->  E* y  x G y )
1412, 13sylbi 121 . . . . . 6  |-  ( Fun  ( F  u.  G
)  ->  E* y  x G y )
1514alrimiv 1927 . . . . 5  |-  ( Fun  ( F  u.  G
)  ->  A. x E* y  x G
y )
1610, 15anim12i 338 . . . 4  |-  ( ( ( Rel  F  /\  Rel  G )  /\  Fun  ( F  u.  G
) )  ->  ( Rel  G  /\  A. x E* y  x G
y ) )
17 dffun6 5391 . . . 4  |-  ( Fun 
G  <->  ( Rel  G  /\  A. x E* y  x G y ) )
1816, 17sylibr 134 . . 3  |-  ( ( ( Rel  F  /\  Rel  G )  /\  Fun  ( F  u.  G
) )  ->  Fun  G )
199, 18jca 306 . 2  |-  ( ( ( Rel  F  /\  Rel  G )  /\  Fun  ( F  u.  G
) )  ->  ( Fun  F  /\  Fun  G
) )
203, 19mpancom 426 1  |-  ( Fun  ( F  u.  G
)  ->  ( Fun  F  /\  Fun  G ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104   A.wal 1400   E*wmo 2087    u. cun 3218   class class class wbr 4130   Rel wrel 4779   Fun wfun 5371
This proof depends on 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 4249  ax-pow 4311  ax-pr 4346
This proof 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-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-fun 5379
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator