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

Theorem bnj1112 35725
Description: Technical lemma for bnj69 35752. 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
bnj1112.1 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
Assertion
Ref Expression
bnj1112 (𝜓 ↔ ∀𝑗((𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛) → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
Distinct variable groups:   𝐴,𝑖,𝑗   𝑅,𝑖,𝑗   𝑓,𝑖,𝑗,𝑦   𝑖,𝑛,𝑗
Allowed substitution hints:   𝜓(𝑦, 𝑓, 𝑖, 𝑗, 𝑛)   𝐴(𝑦, 𝑓, 𝑛)   𝑅(𝑦, 𝑓, 𝑛)

Proof of Theorem bnj1112
StepHypRef Expression
1 bnj1112.1 . . 3 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
21bnj115 35468 . 2 (𝜓 ↔ ∀𝑖((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛) → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3 eleq1w 2850 . . . . 5 (𝑖 = 𝑗 → (𝑖 ∈ ω ↔ 𝑗 ∈ ω))
4 suceq 6456 . . . . . 6 (𝑖 = 𝑗 → suc 𝑖 = suc 𝑗)
54eleq1d 2852 . . . . 5 (𝑖 = 𝑗 → (suc 𝑖 ∈ 𝑛 ↔ suc 𝑗 ∈ 𝑛))
63, 5anbi12d 644 . . . 4 (𝑖 = 𝑗 → ((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛) ↔ (𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛)))
74fveq2d 6919 . . . . 5 (𝑖 = 𝑗 → (𝑓‘suc 𝑖) = (𝑓‘suc 𝑗))
8 fveq2 6915 . . . . . 6 (𝑖 = 𝑗 → (𝑓‘𝑖) = (𝑓‘𝑗))
98bnj1113 35528 . . . . 5 (𝑖 = 𝑗 → ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))
107, 9eqeq12d 2782 . . . 4 (𝑖 = 𝑗 → ((𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
116, 10imbi12d 347 . . 3 (𝑖 = 𝑗 → (((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛) → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ((𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛) → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅))))
1211cbvalvw 2073 . 2 (∀𝑖((𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛) → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑗((𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛) → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
132, 12bitri 278 1 (𝜓 ↔ ∀𝑗((𝑗 ∈ ω ∧ suc 𝑗 ∈ 𝑛) → (𝑓‘suc 𝑗) = ∪ 𝑦 ∈ (𝑓‘𝑗) pred(𝑦, 𝐴, 𝑅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1570   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ∪ ciun 4955  suc csuc 6389  ‘cfv 6565  ωcom 7910   predc-bnj14 35431
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-suc 6393  df-iota 6519  df-fv 6573
This theorem is used by:  bnj1118  35726
  Copyright terms: Public domain W3C validator