Theorem bnj222 35078

Description: Technical lemma for bnj229 35079. 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
bnj222.1	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Assertion

Ref	Expression
bnj222	⊢ (𝜓 ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))

Distinct variable groups:   𝐴,𝑖,𝑚   𝑖,𝐹,𝑚,𝑦   𝑖,𝑁,𝑚   𝑅,𝑖,𝑚

Allowed substitution hints:   𝜓(𝑦,𝑖,𝑚)   𝐴(𝑦)   𝑅(𝑦)   𝑁(𝑦)

Proof of Theorem bnj222

Step	Hyp	Ref	Expression
1		bnj222.1	. 2 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))
2		suceq 6381	. . . . 5 ⊢ (𝑖 = 𝑚 → suc 𝑖 = suc 𝑚)
3	2	eleq1d 2826	. . . 4 ⊢ (𝑖 = 𝑚 → (suc 𝑖 ∈ 𝑁 ↔ suc 𝑚 ∈ 𝑁))
4	2	fveq2d 6834	. . . . 5 ⊢ (𝑖 = 𝑚 → (𝐹‘suc 𝑖) = (𝐹‘suc 𝑚))
5		fveq2 6830	. . . . . 6 ⊢ (𝑖 = 𝑚 → (𝐹‘𝑖) = (𝐹‘𝑚))
6	5	bnj1113 34981	. . . . 5 ⊢ (𝑖 = 𝑚 → ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))
7	4, 6	eqeq12d 2757	. . . 4 ⊢ (𝑖 = 𝑚 → ((𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))
8	3, 7	imbi12d 346	. . 3 ⊢ (𝑖 = 𝑚 → ((suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))))
9	8	cbvralvw 3219	. 2 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))
10	1, 9	bitri 277	1 ⊢ (𝜓 ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1548   ∈ wcel 2121  ∀wral 3055  ∪ ciun 4923  suc csuc 6315  ‘cfv 6488  ωcom 7809   predc-bnj14 34884

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3887  df-un 3889  df-ss 3901  df-nul 4264  df-if 4457  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-iun 4925  df-br 5075  df-suc 6319  df-iota 6444  df-fv 6496

This theorem is referenced by:  bnj229  35079  bnj589  35104