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

Theorem bnj125 35436
Description: Technical lemma for bnj150 35440. 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
bnj125.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj125.2 (𝜑′[1o / 𝑛]𝜑)
bnj125.3 (𝜑″[𝐹 / 𝑓]𝜑′)
bnj125.4 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
Assertion
Ref Expression
bnj125 (𝜑″ ↔ (𝐹‘∅) = pred(𝑥, 𝐴, 𝑅))
Distinct variable groups:   𝐴,𝑓,𝑛   𝑓,𝐹   𝑅,𝑓,𝑛   𝑥,𝑓,𝑛
Allowed substitution hints:   𝜑(𝑥, 𝑓, 𝑛)   𝐴(𝑥)   𝑅(𝑥)   𝐹(𝑥, 𝑛)   𝜑′(𝑥, 𝑓, 𝑛)   𝜑″(𝑥, 𝑓, 𝑛)

Proof of Theorem bnj125
StepHypRef Expression
1 bnj125.3 . 2 (𝜑″[𝐹 / 𝑓]𝜑′)
2 bnj125.2 . . . 4 (𝜑′[1o / 𝑛]𝜑)
32sbcbii 3794 . . 3 ([𝐹 / 𝑓]𝜑′[𝐹 / 𝑓][1o / 𝑛]𝜑)
4 bnj125.1 . . . . . 6 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
5 bnj105 35289 . . . . . 6 1o ∈ V
64, 5bnj91 35425 . . . . 5 ([1o / 𝑛]𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
76sbcbii 3794 . . . 4 ([𝐹 / 𝑓][1o / 𝑛]𝜑[𝐹 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
8 bnj125.4 . . . . . 6 𝐹 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
98bnj95 35428 . . . . 5 𝐹 ∈ V
10 fveq1 6872 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘∅) = (𝐹‘∅))
1110eqeq1d 2762 . . . . 5 (𝑓 = 𝐹 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝐹‘∅) = pred(𝑥, 𝐴, 𝑅)))
129, 11sbcie 3779 . . . 4 ([𝐹 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝐹‘∅) = pred(𝑥, 𝐴, 𝑅))
137, 12bitri 278 . . 3 ([𝐹 / 𝑓][1o / 𝑛]𝜑 ↔ (𝐹‘∅) = pred(𝑥, 𝐴, 𝑅))
143, 13bitri 278 . 2 ([𝐹 / 𝑓]𝜑′ ↔ (𝐹‘∅) = pred(𝑥, 𝐴, 𝑅))
151, 14bitri 278 1 (𝜑″ ↔ (𝐹‘∅) = pred(𝑥, 𝐴, 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209   = wceq 1570  [wsbc 3738  c0 4278  {csn 4583  cop 4589  cfv 6527  1oc1o 8447   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  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-sbc 3739  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4279  df-pw 4558  df-sn 4584  df-pr 4586  df-uni 4867  df-br 5103  df-suc 6357  df-iota 6483  df-fv 6535  df-1o 8454
This theorem is used by:  bnj150  35440  bnj153  35444
  Copyright terms: Public domain W3C validator