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

Theorem bnj154 35442
Description: Technical lemma for bnj153 35444. 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
bnj154.1 (𝜑1[𝑔 / 𝑓]𝜑′)
bnj154.2 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
Assertion
Ref Expression
bnj154 (𝜑1 ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅))
Distinct variable groups:   𝐴,𝑓   𝑅,𝑓   𝑓,𝑔   𝑥,𝑓
Allowed substitution hints:   𝐴(𝑥, 𝑔)   𝑅(𝑥, 𝑔)   𝜑′(𝑥, 𝑓, 𝑔)   𝜑1(𝑥, 𝑓, 𝑔)

Proof of Theorem bnj154
StepHypRef Expression
1 bnj154.1 . 2 (𝜑1[𝑔 / 𝑓]𝜑′)
2 bnj154.2 . . 3 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
32sbcbii 3794 . 2 ([𝑔 / 𝑓]𝜑′[𝑔 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
4 vex 3454 . . 3 𝑔 ∈ V
5 fveq1 6872 . . . 4 (𝑓 = 𝑔 → (𝑓‘∅) = (𝑔‘∅))
65eqeq1d 2762 . . 3 (𝑓 = 𝑔 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅)))
74, 6sbcie 3779 . 2 ([𝑔 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅))
81, 3, 73bitri 300 1 (𝜑1 ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209   = wceq 1570  [wsbc 3738  c0 4278  cfv 6527   predc-bnj14 35253
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-sbc 3739  df-ss 3915  df-uni 4867  df-br 5103  df-iota 6483  df-fv 6535
This theorem is used by:  bnj153  35444  bnj580  35477  bnj607  35480
  Copyright terms: Public domain W3C validator