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 32368
 Description: Technical lemma for bnj69 32407. 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 3444 . . 3 𝑗 ∈ V
3 bnj1039.1 . . . 4 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
4 nfra1 3183 . . . 4 𝑖𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))
53, 4nfxfr 1854 . . 3 𝑖𝜓
62, 5sbcgfi 3794 . 2 ([𝑗 / 𝑖]𝜓𝜓)
71, 6, 33bitri 300 1 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   = wceq 1538   ∈ wcel 2111  ∀wral 3106  [wsbc 3720  ∪ ciun 4882  suc csuc 6162  ‘cfv 6325  ωcom 7563   predc-bnj14 32083 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-12 2175  ax-ext 2770 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-v 3443  df-sbc 3721 This theorem is referenced by:  bnj1128  32387
 Copyright terms: Public domain W3C validator