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

Theorem f1oprg 5617
Description: An unordered pair of ordered pairs with different elements is a one-to-one onto function. (Contributed by Alexander van der Vekens, 14-Aug-2017.)
Assertion
Ref Expression
f1oprg  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y ) )  -> 
( ( A  =/= 
C  /\  B  =/=  D )  ->  { <. A ,  B >. ,  <. C ,  D >. } : { A ,  C } -1-1-onto-> { B ,  D }
) )

Proof of Theorem f1oprg
StepHypRef Expression
1 f1osng 5614 . . . . 5  |-  ( ( A  e.  V  /\  B  e.  W )  ->  { <. A ,  B >. } : { A }
-1-1-onto-> { B } )
21ad2antrr 488 . . . 4  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  ->  { <. A ,  B >. } : { A }
-1-1-onto-> { B } )
3 f1osng 5614 . . . . 5  |-  ( ( C  e.  X  /\  D  e.  Y )  ->  { <. C ,  D >. } : { C }
-1-1-onto-> { D } )
43ad2antlr 489 . . . 4  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  ->  { <. C ,  D >. } : { C }
-1-1-onto-> { D } )
5 disjsn2 3729 . . . . 5  |-  ( A  =/=  C  ->  ( { A }  i^i  { C } )  =  (/) )
65ad2antrl 490 . . . 4  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  -> 
( { A }  i^i  { C } )  =  (/) )
7 disjsn2 3729 . . . . 5  |-  ( B  =/=  D  ->  ( { B }  i^i  { D } )  =  (/) )
87ad2antll 491 . . . 4  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  -> 
( { B }  i^i  { D } )  =  (/) )
9 f1oun 5592 . . . 4  |-  ( ( ( { <. A ,  B >. } : { A } -1-1-onto-> { B }  /\  {
<. C ,  D >. } : { C } -1-1-onto-> { D } )  /\  (
( { A }  i^i  { C } )  =  (/)  /\  ( { B }  i^i  { D } )  =  (/) ) )  ->  ( { <. A ,  B >. }  u.  { <. C ,  D >. } ) : ( { A }  u.  { C } ) -1-1-onto-> ( { B }  u.  { D } ) )
102, 4, 6, 8, 9syl22anc 1272 . . 3  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  -> 
( { <. A ,  B >. }  u.  { <. C ,  D >. } ) : ( { A }  u.  { C } ) -1-1-onto-> ( { B }  u.  { D } ) )
11 df-pr 3673 . . . . . 6  |-  { <. A ,  B >. ,  <. C ,  D >. }  =  ( { <. A ,  B >. }  u.  { <. C ,  D >. } )
1211eqcomi 2233 . . . . 5  |-  ( {
<. A ,  B >. }  u.  { <. C ,  D >. } )  =  { <. A ,  B >. ,  <. C ,  D >. }
1312a1i 9 . . . 4  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  -> 
( { <. A ,  B >. }  u.  { <. C ,  D >. } )  =  { <. A ,  B >. ,  <. C ,  D >. } )
14 df-pr 3673 . . . . . 6  |-  { A ,  C }  =  ( { A }  u.  { C } )
1514eqcomi 2233 . . . . 5  |-  ( { A }  u.  { C } )  =  { A ,  C }
1615a1i 9 . . . 4  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  -> 
( { A }  u.  { C } )  =  { A ,  C } )
17 df-pr 3673 . . . . . 6  |-  { B ,  D }  =  ( { B }  u.  { D } )
1817eqcomi 2233 . . . . 5  |-  ( { B }  u.  { D } )  =  { B ,  D }
1918a1i 9 . . . 4  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  -> 
( { B }  u.  { D } )  =  { B ,  D } )
2013, 16, 19f1oeq123d 5566 . . 3  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  -> 
( ( { <. A ,  B >. }  u.  {
<. C ,  D >. } ) : ( { A }  u.  { C } ) -1-1-onto-> ( { B }  u.  { D } )  <->  { <. A ,  B >. ,  <. C ,  D >. } : { A ,  C } -1-1-onto-> { B ,  D } ) )
2110, 20mpbid 147 . 2  |-  ( ( ( ( A  e.  V  /\  B  e.  W )  /\  ( C  e.  X  /\  D  e.  Y )
)  /\  ( A  =/=  C  /\  B  =/= 
D ) )  ->  { <. A ,  B >. ,  <. C ,  D >. } : { A ,  C } -1-1-onto-> { B ,  D } )
2221ex 115 1  |-  ( ( ( A  e.  V  /\  B  e.  W
)  /\  ( C  e.  X  /\  D  e.  Y ) )  -> 
( ( A  =/= 
C  /\  B  =/=  D )  ->  { <. A ,  B >. ,  <. C ,  D >. } : { A ,  C } -1-1-onto-> { B ,  D }
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200    =/= wne 2400    u. cun 3195    i^i cin 3196   (/)c0 3491   {csn 3666   {cpr 3667   <.cop 3669   -1-1-onto->wf1o 5317
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-in1 617  ax-in2 618  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 4202  ax-pow 4258  ax-pr 4293
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  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-ne 2401  df-ral 2513  df-rex 2514  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325
This theorem is referenced by:  en2prd  6970
  Copyright terms: Public domain W3C validator