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

Theorem bnj590 31208
 Description: Technical lemma for bnj852 31219. 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
bnj590.1 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
Assertion
Ref Expression
bnj590 ((𝐵 = suc 𝑖𝜓) → (𝑖 ∈ ω → (𝐵𝑛 → (𝑓𝐵) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))

Proof of Theorem bnj590
StepHypRef Expression
1 bnj590.1 . . . 4 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
2 rsp 3031 . . . 4 (∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) → (𝑖 ∈ ω → (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
31, 2sylbi 207 . . 3 (𝜓 → (𝑖 ∈ ω → (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
4 eleq1 2791 . . . . 5 (𝐵 = suc 𝑖 → (𝐵𝑛 ↔ suc 𝑖𝑛))
5 fveq2 6304 . . . . . 6 (𝐵 = suc 𝑖 → (𝑓𝐵) = (𝑓‘suc 𝑖))
65eqeq1d 2726 . . . . 5 (𝐵 = suc 𝑖 → ((𝑓𝐵) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
74, 6imbi12d 333 . . . 4 (𝐵 = suc 𝑖 → ((𝐵𝑛 → (𝑓𝐵) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
87imbi2d 329 . . 3 (𝐵 = suc 𝑖 → ((𝑖 ∈ ω → (𝐵𝑛 → (𝑓𝐵) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ (𝑖 ∈ ω → (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))))
93, 8syl5ibr 236 . 2 (𝐵 = suc 𝑖 → (𝜓 → (𝑖 ∈ ω → (𝐵𝑛 → (𝑓𝐵) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))))
109imp 444 1 ((𝐵 = suc 𝑖𝜓) → (𝑖 ∈ ω → (𝐵𝑛 → (𝑓𝐵) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1596   ∈ wcel 2103  ∀wral 3014  ∪ ciun 4628  suc csuc 5838  ‘cfv 6001  ωcom 7182   predc-bnj14 30984 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1835  ax-4 1850  ax-5 1952  ax-6 2018  ax-7 2054  ax-9 2112  ax-10 2132  ax-11 2147  ax-12 2160  ax-13 2355  ax-ext 2704 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1599  df-ex 1818  df-nf 1823  df-sb 2011  df-clab 2711  df-cleq 2717  df-clel 2720  df-nfc 2855  df-ral 3019  df-rex 3020  df-rab 3023  df-v 3306  df-dif 3683  df-un 3685  df-in 3687  df-ss 3694  df-nul 4024  df-if 4195  df-sn 4286  df-pr 4288  df-op 4292  df-uni 4545  df-br 4761  df-iota 5964  df-fv 6009 This theorem is referenced by:  bnj594  31210
 Copyright terms: Public domain W3C validator