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 34875
Description: Technical lemma for bnj153 34877. 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 3813 . 2 ([𝑔 / 𝑓]𝜑′[𝑔 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
4 vex 3454 . . 3 𝑔 ∈ V
5 fveq1 6860 . . . 4 (𝑓 = 𝑔 → (𝑓‘∅) = (𝑔‘∅))
65eqeq1d 2732 . . 3 (𝑓 = 𝑔 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅)))
74, 6sbcie 3798 . 2 ([𝑔 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅))
81, 3, 73bitri 297 1 (𝜑1 ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1540  [wsbc 3756  c0 4299  cfv 6514   predc-bnj14 34685
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-v 3452  df-sbc 3757  df-ss 3934  df-uni 4875  df-br 5111  df-iota 6467  df-fv 6522
This theorem is referenced by:  bnj153  34877  bnj580  34910  bnj607  34913
  Copyright terms: Public domain W3C validator