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

Theorem bnj589 34439
Description: Technical lemma for bnj852 34451. 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.)
Hypothesis
Ref Expression
bnj589.1 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
Assertion
Ref Expression
bnj589 (𝜓 ↔ ∀𝑘 ∈ ω (suc 𝑘𝑛 → (𝑓‘suc 𝑘) = 𝑦 ∈ (𝑓𝑘) pred(𝑦, 𝐴, 𝑅)))
Distinct variable groups:   𝐴,𝑖,𝑘   𝑅,𝑖,𝑘   𝑓,𝑖,𝑘,𝑦   𝑖,𝑛,𝑘
Allowed substitution hints:   𝜓(𝑦,𝑓,𝑖,𝑘,𝑛)   𝐴(𝑦,𝑓,𝑛)   𝑅(𝑦,𝑓,𝑛)

Proof of Theorem bnj589
StepHypRef Expression
1 bnj589.1 . 2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
21bnj222 34413 1 (𝜓 ↔ ∀𝑘 ∈ ω (suc 𝑘𝑛 → (𝑓‘suc 𝑘) = 𝑦 ∈ (𝑓𝑘) pred(𝑦, 𝐴, 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1533  wcel 2098  wral 3053   ciun 4988  suc csuc 6357  cfv 6534  ωcom 7849   predc-bnj14 34218
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2695
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2702  df-cleq 2716  df-clel 2802  df-ral 3054  df-rex 3063  df-rab 3425  df-v 3468  df-dif 3944  df-un 3946  df-in 3948  df-ss 3958  df-nul 4316  df-if 4522  df-sn 4622  df-pr 4624  df-op 4628  df-uni 4901  df-iun 4990  df-br 5140  df-suc 6361  df-iota 6486  df-fv 6542
This theorem is referenced by:  bnj594  34442  bnj1128  34520  bnj1145  34523
  Copyright terms: Public domain W3C validator