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

Theorem bnj526 35185
Description: Technical lemma for bnj852 35218. 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
bnj526.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj526.2 (𝜑″[𝐺 / 𝑓]𝜑)
bnj526.3 𝐺 ∈ V
Assertion
Ref Expression
bnj526 (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))
Distinct variable groups:   𝐴,𝑓   𝑓,𝐺   𝑅,𝑓   𝑓,𝑋
Allowed substitution hints:   𝜑(𝑓)   𝜑″(𝑓)

Proof of Theorem bnj526
StepHypRef Expression
1 bnj526.2 . 2 (𝜑″[𝐺 / 𝑓]𝜑)
2 bnj526.1 . . 3 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
32sbcbii 3802 . 2 ([𝐺 / 𝑓]𝜑[𝐺 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
4 bnj526.3 . . 3 𝐺 ∈ V
5 fveq1 6868 . . . 4 (𝑓 = 𝐺 → (𝑓‘∅) = (𝐺‘∅))
65eqeq1d 2766 . . 3 (𝑓 = 𝐺 → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)))
74, 6sbcie 3787 . 2 ([𝐺 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))
81, 3, 73bitri 299 1 (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wb 208   = wceq 1562  wcel 2144  Vcvv 3456  [wsbc 3746  c0 4287  cfv 6523   predc-bnj14 34986
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736
This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1565  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-v 3458  df-sbc 3747  df-ss 3923  df-uni 4868  df-br 5103  df-iota 6479  df-fv 6531
This theorem is referenced by:  bnj607  35213
  Copyright terms: Public domain W3C validator