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

Theorem bnj1039 31024
 Description: Technical lemma for bnj69 31063. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1039.1 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1039.2 (𝜓′[𝑗 / 𝑖]𝜓)
Assertion
Ref Expression
bnj1039 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))

Proof of Theorem bnj1039
StepHypRef Expression
1 bnj1039.2 . 2 (𝜓′[𝑗 / 𝑖]𝜓)
2 vex 3201 . . 3 𝑗 ∈ V
3 bnj1039.1 . . . . 5 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
4 nfra1 2940 . . . . 5 𝑖𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))
53, 4nfxfr 1778 . . . 4 𝑖𝜓
65sbcgf 3499 . . 3 (𝑗 ∈ V → ([𝑗 / 𝑖]𝜓𝜓))
72, 6ax-mp 5 . 2 ([𝑗 / 𝑖]𝜓𝜓)
81, 7, 33bitri 286 1 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   = wceq 1482   ∈ wcel 1989  ∀wral 2911  Vcvv 3198  [wsbc 3433  ∪ ciun 4518  suc csuc 5723  ‘cfv 5886  ωcom 7062   predc-bnj14 30739 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-9 1998  ax-10 2018  ax-12 2046  ax-13 2245  ax-ext 2601 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1485  df-ex 1704  df-nf 1709  df-sb 1880  df-clab 2608  df-cleq 2614  df-clel 2617  df-ral 2916  df-v 3200  df-sbc 3434 This theorem is referenced by:  bnj1128  31043
 Copyright terms: Public domain W3C validator