Theorem bnj540 35189

Description: Technical lemma for bnj852 35218. 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.)

Hypotheses

Ref	Expression
bnj540.1	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj540.2	⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓)
bnj540.3	⊢ 𝐺 ∈ V

Assertion

Ref	Expression
bnj540	⊢ (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Distinct variable groups:   𝐴,𝑓   𝑓,𝐺,𝑖,𝑦   𝑓,𝑁   𝑅,𝑓

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

Proof of Theorem bnj540

Step	Hyp	Ref	Expression
1		bnj540.2	. 2 ⊢ (𝜓″ ↔ [𝐺 / 𝑓]𝜓)
2		bnj540.1	. . . 4 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3	2	sbcbii 3802	. . 3 ⊢ ([𝐺 / 𝑓]𝜓 ↔ [𝐺 / 𝑓]∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
4		bnj540.3	. . . 4 ⊢ 𝐺 ∈ V
5	4	bnj538 35038	. . 3 ⊢ ([𝐺 / 𝑓]∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω [𝐺 / 𝑓](suc 𝑖 ∈ 𝑁 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
6		sbcimg 3794	. . . . 5 ⊢ (𝐺 ∈ V → ([𝐺 / 𝑓](suc 𝑖 ∈ 𝑁 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ([𝐺 / 𝑓]suc 𝑖 ∈ 𝑁 → [𝐺 / 𝑓](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))))
7	4, 6	ax-mp 5	. . . 4 ⊢ ([𝐺 / 𝑓](suc 𝑖 ∈ 𝑁 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ([𝐺 / 𝑓]suc 𝑖 ∈ 𝑁 → [𝐺 / 𝑓](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
8	7	ralbii 3110	. . 3 ⊢ (∀𝑖 ∈ ω [𝐺 / 𝑓](suc 𝑖 ∈ 𝑁 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω ([𝐺 / 𝑓]suc 𝑖 ∈ 𝑁 → [𝐺 / 𝑓](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
9	3, 5, 8	3bitri 299	. 2 ⊢ ([𝐺 / 𝑓]𝜓 ↔ ∀𝑖 ∈ ω ([𝐺 / 𝑓]suc 𝑖 ∈ 𝑁 → [𝐺 / 𝑓](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
10	4	bnj525 35036	. . . 4 ⊢ ([𝐺 / 𝑓]suc 𝑖 ∈ 𝑁 ↔ suc 𝑖 ∈ 𝑁)
11		fveq1 6868	. . . . . 6 ⊢ (𝑓 = 𝐺 → (𝑓‘suc 𝑖) = (𝐺‘suc 𝑖))
12		fveq1 6868	. . . . . . 7 ⊢ (𝑓 = 𝐺 → (𝑓‘𝑖) = (𝐺‘𝑖))
13	12	bnj1113 35083	. . . . . 6 ⊢ (𝑓 = 𝐺 → ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
14	11, 13	eqeq12d 2780	. . . . 5 ⊢ (𝑓 = 𝐺 → ((𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
15	4, 14	sbcie 3787	. . . 4 ⊢ ([𝐺 / 𝑓](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅))
16	10, 15	imbi12i 352	. . 3 ⊢ (([𝐺 / 𝑓]suc 𝑖 ∈ 𝑁 → [𝐺 / 𝑓](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖 ∈ 𝑁 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
17	16	ralbii 3110	. 2 ⊢ (∀𝑖 ∈ ω ([𝐺 / 𝑓]suc 𝑖 ∈ 𝑁 → [𝐺 / 𝑓](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))
18	1, 9, 17	3bitri 299	1 ⊢ (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐺‘suc 𝑖) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1562   ∈ wcel 2144  ∀wral 3078  Vcvv 3456  [wsbc 3746  ∪ ciun 4951  suc csuc 6350  ‘cfv 6523  ωcom 7848   predc-bnj14 34986

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1565  df-ex 1802  df-nf 1806  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ral 3079  df-rex 3089  df-v 3458  df-sbc 3747  df-ss 3923  df-uni 4868  df-iun 4953  df-br 5103  df-iota 6479  df-fv 6531

This theorem is referenced by:  bnj580  35210  bnj607  35213