Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj157 Structured version   Visualization version   GIF version

Theorem bnj157 34851
Description: Well-founded induction restricted to a set (𝐴 ∈ V). The proof has been taken from Chapter 4 of Don Monk's notes on Set Theory. See http://euclid.colorado.edu/~monkd/setth.pdf. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj157.1 (𝜓 ↔ ∀𝑦𝐴 (𝑦𝑅𝑥[𝑦 / 𝑥]𝜑))
bnj157.2 𝐴 ∈ V
bnj157.3 𝑅 Fr 𝐴
Assertion
Ref Expression
bnj157 (∀𝑥𝐴 (𝜓𝜑) → ∀𝑥𝐴 𝜑)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑅,𝑦   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥,𝑦)

Proof of Theorem bnj157
StepHypRef Expression
1 bnj157.3 . 2 𝑅 Fr 𝐴
2 bnj157.2 . . 3 𝐴 ∈ V
3 bnj157.1 . . 3 (𝜓 ↔ ∀𝑦𝐴 (𝑦𝑅𝑥[𝑦 / 𝑥]𝜑))
42, 3bnj110 34850 . 2 ((𝑅 Fr 𝐴 ∧ ∀𝑥𝐴 (𝜓𝜑)) → ∀𝑥𝐴 𝜑)
51, 4mpan 690 1 (∀𝑥𝐴 (𝜓𝜑) → ∀𝑥𝐴 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wcel 2105  wral 3058  Vcvv 3477  [wsbc 3790   class class class wbr 5147   Fr wfr 5637
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-sep 5301
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-br 5148  df-fr 5640
This theorem is referenced by:  bnj852  34913
  Copyright terms: Public domain W3C validator