Theorem bnj222 34645

Description: Technical lemma for bnj229 34646. 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 6437	. . . . 5 ⊢ (𝑖 = 𝑚 → suc 𝑖 = suc 𝑚)
3	2	eleq1d 2810	. . . 4 ⊢ (𝑖 = 𝑚 → (suc 𝑖 ∈ 𝑁 ↔ suc 𝑚 ∈ 𝑁))
4	2	fveq2d 6900	. . . . 5 ⊢ (𝑖 = 𝑚 → (𝐹‘suc 𝑖) = (𝐹‘suc 𝑚))
5		fveq2 6896	. . . . . 6 ⊢ (𝑖 = 𝑚 → (𝐹‘𝑖) = (𝐹‘𝑚))
6	5	bnj1113 34547	. . . . 5 ⊢ (𝑖 = 𝑚 → ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))
7	4, 6	eqeq12d 2741	. . . 4 ⊢ (𝑖 = 𝑚 → ((𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))
8	3, 7	imbi12d 343	. . 3 ⊢ (𝑖 = 𝑚 → ((suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))))
9	8	cbvralvw 3224	. 2 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))
10	1, 9	bitri 274	1 ⊢ (𝜓 ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1533   ∈ wcel 2098  ∀wral 3050  ∪ ciun 4997  suc csuc 6373  ‘cfv 6549  ωcom 7871   predc-bnj14 34450

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 2696

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ral 3051  df-rex 3060  df-rab 3419  df-v 3463  df-dif 3947  df-un 3949  df-ss 3961  df-nul 4323  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-iun 4999  df-br 5150  df-suc 6377  df-iota 6501  df-fv 6557

This theorem is referenced by:  bnj229  34646  bnj589  34671