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

Theorem cp 7442
Description: Collection Principle. This remarkable theorem scheme is in effect a very strong generalization of the Axiom of Replacement. The proof makes use of Scott's trick scottex 7436 that collapses a proper class into a set of minimum rank. The wff  ph can be thought of as  ph ( x ,  y ). Scheme "Collection Principle" of [Jech] p. 72. (Contributed by NM, 17-Oct-2003.)
Assertion
Ref Expression
cp  |-  E. w A. x  e.  z 
( E. y ph  ->  E. y  e.  w  ph )
Distinct variable groups:    ph, z, w   
x, y, z, w
Allowed substitution hints:    ph( x, y)

Proof of Theorem cp
StepHypRef Expression
1 vex 2728 . . 3  |-  z  e. 
_V
21cplem2 7441 . 2  |-  E. w A. x  e.  z 
( { y  | 
ph }  =/=  (/)  ->  ( { y  |  ph }  i^i  w )  =/=  (/) )
3 abn0 3377 . . . . 5  |-  ( { y  |  ph }  =/=  (/)  <->  E. y ph )
4 elin 3263 . . . . . . . 8  |-  ( y  e.  ( { y  |  ph }  i^i  w )  <->  ( y  e.  { y  |  ph }  /\  y  e.  w
) )
5 abid 2241 . . . . . . . . 9  |-  ( y  e.  { y  | 
ph }  <->  ph )
65anbi1i 679 . . . . . . . 8  |-  ( ( y  e.  { y  |  ph }  /\  y  e.  w )  <->  (
ph  /\  y  e.  w ) )
7 ancom 439 . . . . . . . 8  |-  ( (
ph  /\  y  e.  w )  <->  ( y  e.  w  /\  ph )
)
84, 6, 73bitri 264 . . . . . . 7  |-  ( y  e.  ( { y  |  ph }  i^i  w )  <->  ( y  e.  w  /\  ph )
)
98exbii 1580 . . . . . 6  |-  ( E. y  y  e.  ( { y  |  ph }  i^i  w )  <->  E. y
( y  e.  w  /\  ph ) )
10 nfab1 2387 . . . . . . . 8  |-  F/_ y { y  |  ph }
11 nfcv 2385 . . . . . . . 8  |-  F/_ y
w
1210, 11nfin 3279 . . . . . . 7  |-  F/_ y
( { y  | 
ph }  i^i  w
)
1312n0f 3367 . . . . . 6  |-  ( ( { y  |  ph }  i^i  w )  =/=  (/) 
<->  E. y  y  e.  ( { y  | 
ph }  i^i  w
) )
14 df-rex 2512 . . . . . 6  |-  ( E. y  e.  w  ph  <->  E. y ( y  e.  w  /\  ph )
)
159, 13, 143bitr4i 270 . . . . 5  |-  ( ( { y  |  ph }  i^i  w )  =/=  (/) 
<->  E. y  e.  w  ph )
163, 15imbi12i 318 . . . 4  |-  ( ( { y  |  ph }  =/=  (/)  ->  ( {
y  |  ph }  i^i  w )  =/=  (/) )  <->  ( E. y ph  ->  E. y  e.  w  ph ) )
1716ralbii 2529 . . 3  |-  ( A. x  e.  z  ( { y  |  ph }  =/=  (/)  ->  ( {
y  |  ph }  i^i  w )  =/=  (/) )  <->  A. x  e.  z  ( E. y ph  ->  E. y  e.  w  ph ) )
1817exbii 1580 . 2  |-  ( E. w A. x  e.  z  ( { y  |  ph }  =/=  (/) 
->  ( { y  | 
ph }  i^i  w
)  =/=  (/) )  <->  E. w A. x  e.  z 
( E. y ph  ->  E. y  e.  w  ph ) )
192, 18mpbi 201 1  |-  E. w A. x  e.  z 
( E. y ph  ->  E. y  e.  w  ph )
Colors of variables: wff set class
Syntax hints:    -> wi 6    /\ wa 360   E.wex 1537    e. wcel 1621   {cab 2239    =/= wne 2412   A.wral 2507   E.wrex 2508    i^i cin 3074   (/)c0 3359
This theorem is referenced by:  bnd  7443
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1926  ax-ext 2234  ax-rep 4025  ax-sep 4035  ax-nul 4043  ax-pow 4079  ax-pr 4105  ax-un 4400  ax-reg 7187  ax-inf2 7223
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 940  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1883  df-eu 2118  df-mo 2119  df-clab 2240  df-cleq 2246  df-clel 2249  df-nfc 2374  df-ne 2414  df-ral 2511  df-rex 2512  df-reu 2513  df-rab 2514  df-v 2727  df-sbc 2920  df-csb 3007  df-dif 3078  df-un 3080  df-in 3082  df-ss 3086  df-pss 3088  df-nul 3360  df-if 3468  df-pw 3529  df-sn 3547  df-pr 3548  df-tp 3549  df-op 3550  df-uni 3725  df-int 3758  df-iun 3802  df-iin 3803  df-br 3918  df-opab 3972  df-mpt 3973  df-tr 4008  df-eprel 4195  df-id 4199  df-po 4204  df-so 4205  df-fr 4242  df-we 4244  df-ord 4285  df-on 4286  df-lim 4287  df-suc 4288  df-om 4545  df-xp 4591  df-rel 4592  df-cnv 4593  df-co 4594  df-dm 4595  df-rn 4596  df-res 4597  df-ima 4598  df-fun 4599  df-fn 4600  df-f 4601  df-f1 4602  df-fo 4603  df-f1o 4604  df-fv 4605  df-recs 6271  df-rdg 6306  df-r1 7317  df-rank 7318
  Copyright terms: Public domain W3C validator