Theorem bnj1039 34947

Description: Technical lemma for bnj69 34986. 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
bnj1039.1	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1039.2	⊢ (𝜓′ ↔ [𝑗 / 𝑖]𝜓)

Assertion

Ref	Expression
bnj1039	⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Proof of Theorem bnj1039

Step	Hyp	Ref	Expression
1		bnj1039.2	. 2 ⊢ (𝜓′ ↔ [𝑗 / 𝑖]𝜓)
2		vex 3492	. . 3 ⊢ 𝑗 ∈ V
3		bnj1039.1	. . . 4 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
4		nfra1 3290	. . . 4 ⊢ Ⅎ𝑖∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
5	3, 4	nfxfr 1851	. . 3 ⊢ Ⅎ𝑖𝜓
6	2, 5	sbcgfi 3885	. 2 ⊢ ([𝑗 / 𝑖]𝜓 ↔ 𝜓)
7	1, 6, 3	3bitri 297	1 ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1537   ∈ wcel 2108  ∀wral 3067  [wsbc 3804  ∪ ciun 5015  suc csuc 6397  ‘cfv 6573  ωcom 7903   predc-bnj14 34664

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2178  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-v 3490  df-sbc 3805

This theorem is referenced by:  bnj1128  34966