Theorem bnj222 32805

Description: Technical lemma for bnj229 32806. 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 6321	. . . . 5 ⊢ (𝑖 = 𝑚 → suc 𝑖 = suc 𝑚)
3	2	eleq1d 2821	. . . 4 ⊢ (𝑖 = 𝑚 → (suc 𝑖 ∈ 𝑁 ↔ suc 𝑚 ∈ 𝑁))
4	2	fveq2d 6765	. . . . 5 ⊢ (𝑖 = 𝑚 → (𝐹‘suc 𝑖) = (𝐹‘suc 𝑚))
5		fveq2 6761	. . . . . 6 ⊢ (𝑖 = 𝑚 → (𝐹‘𝑖) = (𝐹‘𝑚))
6	5	bnj1113 32707	. . . . 5 ⊢ (𝑖 = 𝑚 → ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))
7	4, 6	eqeq12d 2753	. . . 4 ⊢ (𝑖 = 𝑚 → ((𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))
8	3, 7	imbi12d 344	. . 3 ⊢ (𝑖 = 𝑚 → ((suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))))
9	8	cbvralvw 3377	. 2 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))
10	1, 9	bitri 274	1 ⊢ (𝜓 ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1539   ∈ wcel 2107  ∀wral 3062  ∪ ciun 4926  suc csuc 6258  ‘cfv 6423  ωcom 7692   predc-bnj14 32609

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2708

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2715  df-cleq 2729  df-clel 2815  df-ral 3067  df-rex 3068  df-rab 3071  df-v 3429  df-dif 3891  df-un 3893  df-in 3895  df-ss 3905  df-nul 4259  df-if 4462  df-sn 4564  df-pr 4566  df-op 4570  df-uni 4842  df-iun 4928  df-br 5076  df-suc 6262  df-iota 6381  df-fv 6431

This theorem is referenced by:  bnj229  32806  bnj589  32831