MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  funprg Structured version   Unicode version

Theorem funprg 5627
Description: A set of two pairs is a function if their first members are different. (Contributed by FL, 26-Jun-2011.)
Assertion
Ref Expression
funprg  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  Fun  {
<. A ,  C >. , 
<. B ,  D >. } )

Proof of Theorem funprg
StepHypRef Expression
1 simp1l 1021 . . . 4  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  A  e.  V )
2 simp2l 1023 . . . 4  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  C  e.  X )
3 funsng 5624 . . . 4  |-  ( ( A  e.  V  /\  C  e.  X )  ->  Fun  { <. A ,  C >. } )
41, 2, 3syl2anc 661 . . 3  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  Fun  {
<. A ,  C >. } )
5 simp1r 1022 . . . 4  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  B  e.  W )
6 simp2r 1024 . . . 4  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  D  e.  Y )
7 funsng 5624 . . . 4  |-  ( ( B  e.  W  /\  D  e.  Y )  ->  Fun  { <. B ,  D >. } )
85, 6, 7syl2anc 661 . . 3  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  Fun  {
<. B ,  D >. } )
9 dmsnopg 5469 . . . . . 6  |-  ( C  e.  X  ->  dom  {
<. A ,  C >. }  =  { A }
)
102, 9syl 16 . . . . 5  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  dom  {
<. A ,  C >. }  =  { A }
)
11 dmsnopg 5469 . . . . . 6  |-  ( D  e.  Y  ->  dom  {
<. B ,  D >. }  =  { B }
)
126, 11syl 16 . . . . 5  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  dom  {
<. B ,  D >. }  =  { B }
)
1310, 12ineq12d 3686 . . . 4  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  ( dom  { <. A ,  C >. }  i^i  dom  { <. B ,  D >. } )  =  ( { A }  i^i  { B } ) )
14 disjsn2 4076 . . . . 5  |-  ( A  =/=  B  ->  ( { A }  i^i  { B } )  =  (/) )
15143ad2ant3 1020 . . . 4  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  ( { A }  i^i  { B } )  =  (/) )
1613, 15eqtrd 2484 . . 3  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  ( dom  { <. A ,  C >. }  i^i  dom  { <. B ,  D >. } )  =  (/) )
17 funun 5620 . . 3  |-  ( ( ( Fun  { <. A ,  C >. }  /\  Fun  { <. B ,  D >. } )  /\  ( dom  { <. A ,  C >. }  i^i  dom  { <. B ,  D >. } )  =  (/) )  ->  Fun  ( { <. A ,  C >. }  u.  { <. B ,  D >. } ) )
184, 8, 16, 17syl21anc 1228 . 2  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  Fun  ( { <. A ,  C >. }  u.  { <. B ,  D >. } ) )
19 df-pr 4017 . . 3  |-  { <. A ,  C >. ,  <. B ,  D >. }  =  ( { <. A ,  C >. }  u.  { <. B ,  D >. } )
2019funeqi 5598 . 2  |-  ( Fun 
{ <. A ,  C >. ,  <. B ,  D >. }  <->  Fun  ( { <. A ,  C >. }  u.  {
<. B ,  D >. } ) )
2118, 20sylibr 212 1  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y )  /\  A  =/=  B )  ->  Fun  {
<. A ,  C >. , 
<. B ,  D >. } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 974    = wceq 1383    e. wcel 1804    =/= wne 2638    u. cun 3459    i^i cin 3460   (/)c0 3770   {csn 4014   {cpr 4016   <.cop 4020   dom cdm 4989   Fun wfun 5572
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-9 1808  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421  ax-sep 4558  ax-nul 4566  ax-pr 4676
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 976  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-eu 2272  df-mo 2273  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-ne 2640  df-ral 2798  df-rex 2799  df-rab 2802  df-v 3097  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3771  df-if 3927  df-sn 4015  df-pr 4017  df-op 4021  df-br 4438  df-opab 4496  df-id 4785  df-xp 4995  df-rel 4996  df-cnv 4997  df-co 4998  df-dm 4999  df-fun 5580
This theorem is referenced by:  funtpg  5628  funpr  5629  fnprg  5632  constr3pthlem2  24632
  Copyright terms: Public domain W3C validator