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

Theorem opeliunxp 4602
Description: Membership in a union of cross products. (Contributed by Mario Carneiro, 29-Dec-2014.) (Revised by Mario Carneiro, 1-Jan-2017.)
Assertion
Ref Expression
opeliunxp  |-  ( <.
x ,  C >.  e. 
U_ x  e.  A  ( { x }  X.  B )  <->  ( x  e.  A  /\  C  e.  B ) )

Proof of Theorem opeliunxp
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2700 . 2  |-  ( <.
x ,  C >.  e. 
U_ x  e.  A  ( { x }  X.  B )  ->  <. x ,  C >.  e.  _V )
2 opexg 4158 . 2  |-  ( ( x  e.  A  /\  C  e.  B )  -> 
<. x ,  C >.  e. 
_V )
3 df-rex 2423 . . . . . 6  |-  ( E. x  e.  A  y  e.  ( { x }  X.  B )  <->  E. x
( x  e.  A  /\  y  e.  ( { x }  X.  B ) ) )
4 nfv 1509 . . . . . . 7  |-  F/ z ( x  e.  A  /\  y  e.  ( { x }  X.  B ) )
5 nfs1v 1913 . . . . . . . 8  |-  F/ x [ z  /  x ] x  e.  A
6 nfcv 2282 . . . . . . . . . 10  |-  F/_ x { z }
7 nfcsb1v 3040 . . . . . . . . . 10  |-  F/_ x [_ z  /  x ]_ B
86, 7nfxp 4574 . . . . . . . . 9  |-  F/_ x
( { z }  X.  [_ z  /  x ]_ B )
98nfcri 2276 . . . . . . . 8  |-  F/ x  y  e.  ( {
z }  X.  [_ z  /  x ]_ B
)
105, 9nfan 1545 . . . . . . 7  |-  F/ x
( [ z  /  x ] x  e.  A  /\  y  e.  ( { z }  X.  [_ z  /  x ]_ B ) )
11 sbequ12 1745 . . . . . . . 8  |-  ( x  =  z  ->  (
x  e.  A  <->  [ z  /  x ] x  e.  A ) )
12 sneq 3543 . . . . . . . . . 10  |-  ( x  =  z  ->  { x }  =  { z } )
13 csbeq1a 3016 . . . . . . . . . 10  |-  ( x  =  z  ->  B  =  [_ z  /  x ]_ B )
1412, 13xpeq12d 4572 . . . . . . . . 9  |-  ( x  =  z  ->  ( { x }  X.  B )  =  ( { z }  X.  [_ z  /  x ]_ B ) )
1514eleq2d 2210 . . . . . . . 8  |-  ( x  =  z  ->  (
y  e.  ( { x }  X.  B
)  <->  y  e.  ( { z }  X.  [_ z  /  x ]_ B ) ) )
1611, 15anbi12d 465 . . . . . . 7  |-  ( x  =  z  ->  (
( x  e.  A  /\  y  e.  ( { x }  X.  B ) )  <->  ( [
z  /  x ]
x  e.  A  /\  y  e.  ( {
z }  X.  [_ z  /  x ]_ B
) ) ) )
174, 10, 16cbvex 1730 . . . . . 6  |-  ( E. x ( x  e.  A  /\  y  e.  ( { x }  X.  B ) )  <->  E. z
( [ z  /  x ] x  e.  A  /\  y  e.  ( { z }  X.  [_ z  /  x ]_ B ) ) )
183, 17bitri 183 . . . . 5  |-  ( E. x  e.  A  y  e.  ( { x }  X.  B )  <->  E. z
( [ z  /  x ] x  e.  A  /\  y  e.  ( { z }  X.  [_ z  /  x ]_ B ) ) )
19 eleq1 2203 . . . . . . 7  |-  ( y  =  <. x ,  C >.  ->  ( y  e.  ( { z }  X.  [_ z  /  x ]_ B )  <->  <. x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) ) )
2019anbi2d 460 . . . . . 6  |-  ( y  =  <. x ,  C >.  ->  ( ( [ z  /  x ]
x  e.  A  /\  y  e.  ( {
z }  X.  [_ z  /  x ]_ B
) )  <->  ( [
z  /  x ]
x  e.  A  /\  <.
x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) ) ) )
2120exbidv 1798 . . . . 5  |-  ( y  =  <. x ,  C >.  ->  ( E. z
( [ z  /  x ] x  e.  A  /\  y  e.  ( { z }  X.  [_ z  /  x ]_ B ) )  <->  E. z
( [ z  /  x ] x  e.  A  /\  <. x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) ) ) )
2218, 21syl5bb 191 . . . 4  |-  ( y  =  <. x ,  C >.  ->  ( E. x  e.  A  y  e.  ( { x }  X.  B )  <->  E. z
( [ z  /  x ] x  e.  A  /\  <. x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) ) ) )
23 df-iun 3823 . . . 4  |-  U_ x  e.  A  ( {
x }  X.  B
)  =  { y  |  E. x  e.  A  y  e.  ( { x }  X.  B ) }
2422, 23elab2g 2835 . . 3  |-  ( <.
x ,  C >.  e. 
_V  ->  ( <. x ,  C >.  e.  U_ x  e.  A  ( {
x }  X.  B
)  <->  E. z ( [ z  /  x ]
x  e.  A  /\  <.
x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) ) ) )
25 opelxp 4577 . . . . . . 7  |-  ( <.
x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B )  <->  ( x  e.  { z }  /\  C  e.  [_ z  /  x ]_ B ) )
2625anbi2i 453 . . . . . 6  |-  ( ( [ z  /  x ] x  e.  A  /\  <. x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) )  <->  ( [ z  /  x ] x  e.  A  /\  (
x  e.  { z }  /\  C  e. 
[_ z  /  x ]_ B ) ) )
27 an12 551 . . . . . 6  |-  ( ( [ z  /  x ] x  e.  A  /\  ( x  e.  {
z }  /\  C  e.  [_ z  /  x ]_ B ) )  <->  ( x  e.  { z }  /\  ( [ z  /  x ] x  e.  A  /\  C  e.  [_ z  /  x ]_ B ) ) )
28 velsn 3549 . . . . . . . 8  |-  ( x  e.  { z }  <-> 
x  =  z )
29 equcom 1683 . . . . . . . 8  |-  ( x  =  z  <->  z  =  x )
3028, 29bitri 183 . . . . . . 7  |-  ( x  e.  { z }  <-> 
z  =  x )
3130anbi1i 454 . . . . . 6  |-  ( ( x  e.  { z }  /\  ( [ z  /  x ]
x  e.  A  /\  C  e.  [_ z  /  x ]_ B ) )  <-> 
( z  =  x  /\  ( [ z  /  x ] x  e.  A  /\  C  e. 
[_ z  /  x ]_ B ) ) )
3226, 27, 313bitri 205 . . . . 5  |-  ( ( [ z  /  x ] x  e.  A  /\  <. x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) )  <->  ( z  =  x  /\  ( [ z  /  x ]
x  e.  A  /\  C  e.  [_ z  /  x ]_ B ) ) )
3332exbii 1585 . . . 4  |-  ( E. z ( [ z  /  x ] x  e.  A  /\  <. x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) )  <->  E. z
( z  =  x  /\  ( [ z  /  x ] x  e.  A  /\  C  e. 
[_ z  /  x ]_ B ) ) )
34 vex 2692 . . . . 5  |-  x  e. 
_V
35 sbequ12r 1746 . . . . . 6  |-  ( z  =  x  ->  ( [ z  /  x ] x  e.  A  <->  x  e.  A ) )
3613equcoms 1685 . . . . . . . 8  |-  ( z  =  x  ->  B  =  [_ z  /  x ]_ B )
3736eqcomd 2146 . . . . . . 7  |-  ( z  =  x  ->  [_ z  /  x ]_ B  =  B )
3837eleq2d 2210 . . . . . 6  |-  ( z  =  x  ->  ( C  e.  [_ z  /  x ]_ B  <->  C  e.  B ) )
3935, 38anbi12d 465 . . . . 5  |-  ( z  =  x  ->  (
( [ z  /  x ] x  e.  A  /\  C  e.  [_ z  /  x ]_ B )  <-> 
( x  e.  A  /\  C  e.  B
) ) )
4034, 39ceqsexv 2728 . . . 4  |-  ( E. z ( z  =  x  /\  ( [ z  /  x ]
x  e.  A  /\  C  e.  [_ z  /  x ]_ B ) )  <-> 
( x  e.  A  /\  C  e.  B
) )
4133, 40bitri 183 . . 3  |-  ( E. z ( [ z  /  x ] x  e.  A  /\  <. x ,  C >.  e.  ( { z }  X.  [_ z  /  x ]_ B ) )  <->  ( x  e.  A  /\  C  e.  B ) )
4224, 41syl6bb 195 . 2  |-  ( <.
x ,  C >.  e. 
_V  ->  ( <. x ,  C >.  e.  U_ x  e.  A  ( {
x }  X.  B
)  <->  ( x  e.  A  /\  C  e.  B ) ) )
431, 2, 42pm5.21nii 694 1  |-  ( <.
x ,  C >.  e. 
U_ x  e.  A  ( { x }  X.  B )  <->  ( x  e.  A  /\  C  e.  B ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    = wceq 1332   E.wex 1469    e. wcel 1481   [wsb 1736   E.wrex 2418   _Vcvv 2689   [_csb 3007   {csn 3532   <.cop 3535   U_ciun 3821    X. cxp 4545
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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-csb 3008  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-iun 3823  df-opab 3998  df-xp 4553
This theorem is referenced by:  eliunxp  4686  opeliunxp2  4687  opeliunxp2f  6143
  Copyright terms: Public domain W3C validator