MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  bnd Structured version   Visualization version   GIF version

Theorem bnd 8715
Description: A very strong generalization of the Axiom of Replacement (compare zfrep6 7096), derived from the Collection Principle cp 8714. Its strength lies in the rather profound fact that 𝜑(𝑥, 𝑦) does not have to be a "function-like" wff, as it does in the standard Axiom of Replacement. This theorem is sometimes called the Boundedness Axiom. (Contributed by NM, 17-Oct-2004.)
Assertion
Ref Expression
bnd (∀𝑥𝑧𝑦𝜑 → ∃𝑤𝑥𝑧𝑦𝑤 𝜑)
Distinct variable groups:   𝜑,𝑧,𝑤   𝑥,𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem bnd
StepHypRef Expression
1 cp 8714 . . 3 𝑤𝑥𝑧 (∃𝑦𝜑 → ∃𝑦𝑤 𝜑)
2 ralim 2944 . . 3 (∀𝑥𝑧 (∃𝑦𝜑 → ∃𝑦𝑤 𝜑) → (∀𝑥𝑧𝑦𝜑 → ∀𝑥𝑧𝑦𝑤 𝜑))
31, 2eximii 1761 . 2 𝑤(∀𝑥𝑧𝑦𝜑 → ∀𝑥𝑧𝑦𝑤 𝜑)
4319.37iv 1908 1 (∀𝑥𝑧𝑦𝜑 → ∃𝑤𝑥𝑧𝑦𝑤 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wex 1701  wral 2908  wrex 2909
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4741  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914  ax-reg 8457  ax-inf2 8498
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-reu 2915  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-pss 3576  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-tp 4160  df-op 4162  df-uni 4410  df-int 4448  df-iun 4494  df-iin 4495  df-br 4624  df-opab 4684  df-mpt 4685  df-tr 4723  df-eprel 4995  df-id 4999  df-po 5005  df-so 5006  df-fr 5043  df-we 5045  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-pred 5649  df-ord 5695  df-on 5696  df-lim 5697  df-suc 5698  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-om 7028  df-wrecs 7367  df-recs 7428  df-rdg 7466  df-r1 8587  df-rank 8588
This theorem is referenced by:  bnd2  8716
  Copyright terms: Public domain W3C validator