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

Theorem ixpsnf1o 7094
Description: A bijection between a class and single-point functions to it. (Contributed by Stefan O'Rear, 24-Jan-2015.)
Hypothesis
Ref Expression
ixpsnf1o.f  |-  F  =  ( x  e.  A  |->  ( { I }  X.  { x } ) )
Assertion
Ref Expression
ixpsnf1o  |-  ( I  e.  V  ->  F : A -1-1-onto-> X_ y  e.  {
I } A )
Distinct variable groups:    x, I,
y    x, A, y    x, V, y    y, F
Allowed substitution hint:    F( x)

Proof of Theorem ixpsnf1o
Dummy variables  a 
b  c are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ixpsnf1o.f . 2  |-  F  =  ( x  e.  A  |->  ( { I }  X.  { x } ) )
2 snex 4397 . . . 4  |-  { I }  e.  _V
3 snex 4397 . . . 4  |-  { x }  e.  _V
42, 3xpex 4982 . . 3  |-  ( { I }  X.  {
x } )  e. 
_V
54a1i 11 . 2  |-  ( ( I  e.  V  /\  x  e.  A )  ->  ( { I }  X.  { x } )  e.  _V )
6 vex 2951 . . . . 5  |-  a  e. 
_V
76rnex 5125 . . . 4  |-  ran  a  e.  _V
87uniex 4697 . . 3  |-  U. ran  a  e.  _V
98a1i 11 . 2  |-  ( ( I  e.  V  /\  a  e.  X_ y  e. 
{ I } A
)  ->  U. ran  a  e.  _V )
10 sneq 3817 . . . . . 6  |-  ( b  =  I  ->  { b }  =  { I } )
1110xpeq1d 4893 . . . . 5  |-  ( b  =  I  ->  ( { b }  X.  { x } )  =  ( { I }  X.  { x }
) )
1211eqeq2d 2446 . . . 4  |-  ( b  =  I  ->  (
a  =  ( { b }  X.  {
x } )  <->  a  =  ( { I }  X.  { x } ) ) )
1312anbi2d 685 . . 3  |-  ( b  =  I  ->  (
( x  e.  A  /\  a  =  ( { b }  X.  { x } ) )  <->  ( x  e.  A  /\  a  =  ( { I }  X.  { x } ) ) ) )
14 vex 2951 . . . . . 6  |-  b  e. 
_V
15 elixpsn 7093 . . . . . 6  |-  ( b  e.  _V  ->  (
a  e.  X_ y  e.  { b } A  <->  E. c  e.  A  a  =  { <. b ,  c >. } ) )
1614, 15ax-mp 8 . . . . 5  |-  ( a  e.  X_ y  e.  {
b } A  <->  E. c  e.  A  a  =  { <. b ,  c
>. } )
1710ixpeq1d 7066 . . . . . 6  |-  ( b  =  I  ->  X_ y  e.  { b } A  =  X_ y  e.  {
I } A )
1817eleq2d 2502 . . . . 5  |-  ( b  =  I  ->  (
a  e.  X_ y  e.  { b } A  <->  a  e.  X_ y  e.  {
I } A ) )
1916, 18syl5bbr 251 . . . 4  |-  ( b  =  I  ->  ( E. c  e.  A  a  =  { <. b ,  c >. }  <->  a  e.  X_ y  e.  { I } A ) )
2019anbi1d 686 . . 3  |-  ( b  =  I  ->  (
( E. c  e.  A  a  =  { <. b ,  c >. }  /\  x  =  U. ran  a )  <->  ( a  e.  X_ y  e.  {
I } A  /\  x  =  U. ran  a
) ) )
21 vex 2951 . . . . . . 7  |-  x  e. 
_V
2214, 21xpsn 5902 . . . . . 6  |-  ( { b }  X.  {
x } )  =  { <. b ,  x >. }
2322eqeq2i 2445 . . . . 5  |-  ( a  =  ( { b }  X.  { x } )  <->  a  =  { <. b ,  x >. } )
2423anbi2i 676 . . . 4  |-  ( ( x  e.  A  /\  a  =  ( {
b }  X.  {
x } ) )  <-> 
( x  e.  A  /\  a  =  { <. b ,  x >. } ) )
25 eqid 2435 . . . . . . . . 9  |-  { <. b ,  x >. }  =  { <. b ,  x >. }
26 opeq2 3977 . . . . . . . . . . . 12  |-  ( c  =  x  ->  <. b ,  c >.  =  <. b ,  x >. )
2726sneqd 3819 . . . . . . . . . . 11  |-  ( c  =  x  ->  { <. b ,  c >. }  =  { <. b ,  x >. } )
2827eqeq2d 2446 . . . . . . . . . 10  |-  ( c  =  x  ->  ( { <. b ,  x >. }  =  { <. b ,  c >. }  <->  { <. b ,  x >. }  =  { <. b ,  x >. } ) )
2928rspcev 3044 . . . . . . . . 9  |-  ( ( x  e.  A  /\  {
<. b ,  x >. }  =  { <. b ,  x >. } )  ->  E. c  e.  A  { <. b ,  x >. }  =  { <. b ,  c >. } )
3025, 29mpan2 653 . . . . . . . 8  |-  ( x  e.  A  ->  E. c  e.  A  { <. b ,  x >. }  =  { <. b ,  c >. } )
3114, 21op2nda 5346 . . . . . . . . 9  |-  U. ran  {
<. b ,  x >. }  =  x
3231eqcomi 2439 . . . . . . . 8  |-  x  = 
U. ran  { <. b ,  x >. }
3330, 32jctir 525 . . . . . . 7  |-  ( x  e.  A  ->  ( E. c  e.  A  { <. b ,  x >. }  =  { <. b ,  c >. }  /\  x  =  U. ran  { <. b ,  x >. } ) )
34 eqeq1 2441 . . . . . . . . 9  |-  ( a  =  { <. b ,  x >. }  ->  (
a  =  { <. b ,  c >. }  <->  { <. b ,  x >. }  =  { <. b ,  c >. } ) )
3534rexbidv 2718 . . . . . . . 8  |-  ( a  =  { <. b ,  x >. }  ->  ( E. c  e.  A  a  =  { <. b ,  c >. }  <->  E. c  e.  A  { <. b ,  x >. }  =  { <. b ,  c >. } ) )
36 rneq 5087 . . . . . . . . . 10  |-  ( a  =  { <. b ,  x >. }  ->  ran  a  =  ran  { <. b ,  x >. } )
3736unieqd 4018 . . . . . . . . 9  |-  ( a  =  { <. b ,  x >. }  ->  U. ran  a  =  U. ran  { <. b ,  x >. } )
3837eqeq2d 2446 . . . . . . . 8  |-  ( a  =  { <. b ,  x >. }  ->  (
x  =  U. ran  a 
<->  x  =  U. ran  {
<. b ,  x >. } ) )
3935, 38anbi12d 692 . . . . . . 7  |-  ( a  =  { <. b ,  x >. }  ->  (
( E. c  e.  A  a  =  { <. b ,  c >. }  /\  x  =  U. ran  a )  <->  ( E. c  e.  A  { <. b ,  x >. }  =  { <. b ,  c >. }  /\  x  =  U. ran  { <. b ,  x >. } ) ) )
4033, 39syl5ibrcom 214 . . . . . 6  |-  ( x  e.  A  ->  (
a  =  { <. b ,  x >. }  ->  ( E. c  e.  A  a  =  { <. b ,  c >. }  /\  x  =  U. ran  a
) ) )
4140imp 419 . . . . 5  |-  ( ( x  e.  A  /\  a  =  { <. b ,  x >. } )  -> 
( E. c  e.  A  a  =  { <. b ,  c >. }  /\  x  =  U. ran  a ) )
42 vex 2951 . . . . . . . . . . 11  |-  c  e. 
_V
4314, 42op2nda 5346 . . . . . . . . . 10  |-  U. ran  {
<. b ,  c >. }  =  c
4443eqeq2i 2445 . . . . . . . . 9  |-  ( x  =  U. ran  { <. b ,  c >. } 
<->  x  =  c )
45 eqidd 2436 . . . . . . . . . . 11  |-  ( c  e.  A  ->  { <. b ,  c >. }  =  { <. b ,  c
>. } )
4645ancli 535 . . . . . . . . . 10  |-  ( c  e.  A  ->  (
c  e.  A  /\  {
<. b ,  c >. }  =  { <. b ,  c >. } ) )
47 eleq1 2495 . . . . . . . . . . 11  |-  ( x  =  c  ->  (
x  e.  A  <->  c  e.  A ) )
48 opeq2 3977 . . . . . . . . . . . . 13  |-  ( x  =  c  ->  <. b ,  x >.  =  <. b ,  c >. )
4948sneqd 3819 . . . . . . . . . . . 12  |-  ( x  =  c  ->  { <. b ,  x >. }  =  { <. b ,  c
>. } )
5049eqeq2d 2446 . . . . . . . . . . 11  |-  ( x  =  c  ->  ( { <. b ,  c
>. }  =  { <. b ,  x >. }  <->  { <. b ,  c >. }  =  { <. b ,  c
>. } ) )
5147, 50anbi12d 692 . . . . . . . . . 10  |-  ( x  =  c  ->  (
( x  e.  A  /\  { <. b ,  c
>. }  =  { <. b ,  x >. } )  <-> 
( c  e.  A  /\  { <. b ,  c
>. }  =  { <. b ,  c >. } ) ) )
5246, 51syl5ibrcom 214 . . . . . . . . 9  |-  ( c  e.  A  ->  (
x  =  c  -> 
( x  e.  A  /\  { <. b ,  c
>. }  =  { <. b ,  x >. } ) ) )
5344, 52syl5bi 209 . . . . . . . 8  |-  ( c  e.  A  ->  (
x  =  U. ran  {
<. b ,  c >. }  ->  ( x  e.  A  /\  { <. b ,  c >. }  =  { <. b ,  x >. } ) ) )
54 rneq 5087 . . . . . . . . . . 11  |-  ( a  =  { <. b ,  c >. }  ->  ran  a  =  ran  { <. b ,  c >. } )
5554unieqd 4018 . . . . . . . . . 10  |-  ( a  =  { <. b ,  c >. }  ->  U.
ran  a  =  U. ran  { <. b ,  c
>. } )
5655eqeq2d 2446 . . . . . . . . 9  |-  ( a  =  { <. b ,  c >. }  ->  ( x  =  U. ran  a 
<->  x  =  U. ran  {
<. b ,  c >. } ) )
57 eqeq1 2441 . . . . . . . . . 10  |-  ( a  =  { <. b ,  c >. }  ->  ( a  =  { <. b ,  x >. }  <->  { <. b ,  c >. }  =  { <. b ,  x >. } ) )
5857anbi2d 685 . . . . . . . . 9  |-  ( a  =  { <. b ,  c >. }  ->  ( ( x  e.  A  /\  a  =  { <. b ,  x >. } )  <->  ( x  e.  A  /\  { <. b ,  c >. }  =  { <. b ,  x >. } ) ) )
5956, 58imbi12d 312 . . . . . . . 8  |-  ( a  =  { <. b ,  c >. }  ->  ( ( x  =  U. ran  a  ->  ( x  e.  A  /\  a  =  { <. b ,  x >. } ) )  <->  ( x  =  U. ran  { <. b ,  c >. }  ->  ( x  e.  A  /\  {
<. b ,  c >. }  =  { <. b ,  x >. } ) ) ) )
6053, 59syl5ibrcom 214 . . . . . . 7  |-  ( c  e.  A  ->  (
a  =  { <. b ,  c >. }  ->  ( x  =  U. ran  a  ->  ( x  e.  A  /\  a  =  { <. b ,  x >. } ) ) ) )
6160rexlimiv 2816 . . . . . 6  |-  ( E. c  e.  A  a  =  { <. b ,  c >. }  ->  ( x  =  U. ran  a  ->  ( x  e.  A  /\  a  =  { <. b ,  x >. } ) ) )
6261imp 419 . . . . 5  |-  ( ( E. c  e.  A  a  =  { <. b ,  c >. }  /\  x  =  U. ran  a
)  ->  ( x  e.  A  /\  a  =  { <. b ,  x >. } ) )
6341, 62impbii 181 . . . 4  |-  ( ( x  e.  A  /\  a  =  { <. b ,  x >. } )  <->  ( E. c  e.  A  a  =  { <. b ,  c
>. }  /\  x  = 
U. ran  a )
)
6424, 63bitri 241 . . 3  |-  ( ( x  e.  A  /\  a  =  ( {
b }  X.  {
x } ) )  <-> 
( E. c  e.  A  a  =  { <. b ,  c >. }  /\  x  =  U. ran  a ) )
6513, 20, 64vtoclbg 3004 . 2  |-  ( I  e.  V  ->  (
( x  e.  A  /\  a  =  ( { I }  X.  { x } ) )  <->  ( a  e.  X_ y  e.  { I } A  /\  x  =  U. ran  a ) ) )
661, 5, 9, 65f1od 6286 1  |-  ( I  e.  V  ->  F : A -1-1-onto-> X_ y  e.  {
I } A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359    = wceq 1652    e. wcel 1725   E.wrex 2698   _Vcvv 2948   {csn 3806   <.cop 3809   U.cuni 4007    e. cmpt 4258    X. cxp 4868   ran crn 4871   -1-1-onto->wf1o 5445   X_cixp 7055
This theorem is referenced by:  mapsnf1o  7095
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pow 4369  ax-pr 4395  ax-un 4693
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-reu 2704  df-rab 2706  df-v 2950  df-sbc 3154  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-br 4205  df-opab 4259  df-mpt 4260  df-id 4490  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883  df-iota 5410  df-fun 5448  df-fn 5449  df-f 5450  df-f1 5451  df-fo 5452  df-f1o 5453  df-fv 5454  df-ixp 7056
  Copyright terms: Public domain W3C validator