Theorem inrab 3453

Description: Intersection of two restricted class abstractions. (Contributed by NM, 1-Sep-2006.)

Assertion

Ref	Expression
inrab	|- ( { x e. A | ph } i^i { x e. A | ps } ) = { x e. A | ( ph /\ ps ) }

Proof of Theorem inrab

Step	Hyp	Ref	Expression
1		df-rab 2495	. . 3 |- { x e. A | ph } = { x | ( x e. A /\ ph ) }
2		df-rab 2495	. . 3 |- { x e. A | ps } = { x | ( x e. A /\ ps ) }
3	1, 2	ineq12i 3380	. 2 |- ( { x e. A | ph } i^i { x e. A | ps } ) = ( { x | ( x e. A /\ ph ) } i^i { x | ( x e. A /\ ps ) } )
4		df-rab 2495	. . 3 |- { x e. A | ( ph /\ ps ) } = { x | ( x e. A /\ ( ph /\ ps ) ) }
5		inab 3449	. . . 4 |- ( { x | ( x e. A /\ ph ) } i^i { x | ( x e. A /\ ps ) } ) = { x | ( ( x e. A /\ ph ) /\ ( x e. A /\ ps ) ) }
6		anandi 590	. . . . 5 |- ( ( x e. A /\ ( ph /\ ps ) ) <-> ( ( x e. A /\ ph ) /\ ( x e. A /\ ps ) ) )
7	6	abbii 2323	. . . 4 |- { x | ( x e. A /\ ( ph /\ ps ) ) } = { x | ( ( x e. A /\ ph ) /\ ( x e. A /\ ps ) ) }
8	5, 7	eqtr4i 2231	. . 3 |- ( { x | ( x e. A /\ ph ) } i^i { x | ( x e. A /\ ps ) } ) = { x | ( x e. A /\ ( ph /\ ps ) ) }
9	4, 8	eqtr4i 2231	. 2 |- { x e. A | ( ph /\ ps ) } = ( { x | ( x e. A /\ ph ) } i^i { x | ( x e. A /\ ps ) } )
10	3, 9	eqtr4i 2231	1 |- ( { x e. A | ph } i^i { x e. A | ps } ) = { x e. A | ( ph /\ ps ) }

Syntax hints:   /\ wa 104   = wceq 1373   e. wcel 2178   {cab 2193   {crab 2490   i^i cin 3173

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-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-rab 2495  df-v 2778  df-in 3180

This theorem is referenced by:  rabnc  3501  iooinsup  11703  phiprmpw  12659  unennn  12883  dfrhm2  14031  lgsquadlem2  15670  umgrislfupgrenlem  15836