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

Theorem iinrab2 4359
Description: Indexed intersection of a restricted class builder. (Contributed by NM, 6-Dec-2011.)
Assertion
Ref Expression
iinrab2  |-  ( |^|_ x  e.  A  { y  e.  B  |  ph }  i^i  B )  =  { y  e.  B  |  A. x  e.  A  ph }
Distinct variable groups:    y, A, x    x, B, y
Allowed substitution hints:    ph( x, y)

Proof of Theorem iinrab2
StepHypRef Expression
1 iineq1 4311 . . . . . 6  |-  ( A  =  (/)  ->  |^|_ x  e.  A  { y  e.  B  |  ph }  =  |^|_ x  e.  (/)  { y  e.  B  |  ph } )
2 0iin 4354 . . . . . 6  |-  |^|_ x  e.  (/)  { y  e.  B  |  ph }  =  _V
31, 2syl6eq 2479 . . . . 5  |-  ( A  =  (/)  ->  |^|_ x  e.  A  { y  e.  B  |  ph }  =  _V )
43ineq1d 3663 . . . 4  |-  ( A  =  (/)  ->  ( |^|_ x  e.  A  { y  e.  B  |  ph }  i^i  B )  =  ( _V  i^i  B
) )
5 incom 3655 . . . . 5  |-  ( _V 
i^i  B )  =  ( B  i^i  _V )
6 inv1 3789 . . . . 5  |-  ( B  i^i  _V )  =  B
75, 6eqtri 2451 . . . 4  |-  ( _V 
i^i  B )  =  B
84, 7syl6eq 2479 . . 3  |-  ( A  =  (/)  ->  ( |^|_ x  e.  A  { y  e.  B  |  ph }  i^i  B )  =  B )
9 rzal 3899 . . . 4  |-  ( A  =  (/)  ->  A. x  e.  A  A. y  e.  B  ph )
10 rabid2 3006 . . . . 5  |-  ( B  =  { y  e.  B  |  A. x  e.  A  ph }  <->  A. y  e.  B  A. x  e.  A  ph )
11 ralcom 2989 . . . . 5  |-  ( A. y  e.  B  A. x  e.  A  ph  <->  A. x  e.  A  A. y  e.  B  ph )
1210, 11bitr2i 253 . . . 4  |-  ( A. x  e.  A  A. y  e.  B  ph  <->  B  =  { y  e.  B  |  A. x  e.  A  ph } )
139, 12sylib 199 . . 3  |-  ( A  =  (/)  ->  B  =  { y  e.  B  |  A. x  e.  A  ph } )
148, 13eqtrd 2463 . 2  |-  ( A  =  (/)  ->  ( |^|_ x  e.  A  { y  e.  B  |  ph }  i^i  B )  =  { y  e.  B  |  A. x  e.  A  ph } )
15 iinrab 4358 . . . 4  |-  ( A  =/=  (/)  ->  |^|_ x  e.  A  { y  e.  B  |  ph }  =  { y  e.  B  |  A. x  e.  A  ph } )
1615ineq1d 3663 . . 3  |-  ( A  =/=  (/)  ->  ( |^|_ x  e.  A  { y  e.  B  |  ph }  i^i  B )  =  ( { y  e.  B  |  A. x  e.  A  ph }  i^i  B ) )
17 ssrab2 3546 . . . 4  |-  { y  e.  B  |  A. x  e.  A  ph }  C_  B
18 dfss 3451 . . . 4  |-  ( { y  e.  B  |  A. x  e.  A  ph }  C_  B  <->  { y  e.  B  |  A. x  e.  A  ph }  =  ( { y  e.  B  |  A. x  e.  A  ph }  i^i  B ) )
1917, 18mpbi 211 . . 3  |-  { y  e.  B  |  A. x  e.  A  ph }  =  ( { y  e.  B  |  A. x  e.  A  ph }  i^i  B )
2016, 19syl6eqr 2481 . 2  |-  ( A  =/=  (/)  ->  ( |^|_ x  e.  A  { y  e.  B  |  ph }  i^i  B )  =  { y  e.  B  |  A. x  e.  A  ph } )
2114, 20pm2.61ine 2737 1  |-  ( |^|_ x  e.  A  { y  e.  B  |  ph }  i^i  B )  =  { y  e.  B  |  A. x  e.  A  ph }
Colors of variables: wff setvar class
Syntax hints:    = wceq 1437    =/= wne 2618   A.wral 2775   {crab 2779   _Vcvv 3081    i^i cin 3435    C_ wss 3436   (/)c0 3761   |^|_ciin 4297
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1839  ax-10 1887  ax-11 1892  ax-12 1905  ax-13 2053  ax-ext 2400
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1787  df-clab 2408  df-cleq 2414  df-clel 2417  df-nfc 2572  df-ne 2620  df-ral 2780  df-rab 2784  df-v 3083  df-dif 3439  df-in 3443  df-ss 3450  df-nul 3762  df-iin 4299
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator