Theorem bnj92 35220

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj92.1	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj92.2	⊢ 𝑍 ∈ V

Assertion

Ref	Expression
bnj92	⊢ ([𝑍 / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑍 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Distinct variable groups:   𝐴,𝑛   𝑅,𝑛   𝑖,𝑍   𝑓,𝑛   𝑖,𝑛   𝑦,𝑛

Allowed substitution hints:   𝜓(𝑦,𝑓,𝑖,𝑛)   𝐴(𝑦,𝑓,𝑖)   𝑅(𝑦,𝑓,𝑖)   𝑍(𝑦,𝑓,𝑛)

Proof of Theorem bnj92

Step	Hyp	Ref	Expression
1		bnj92.1	. . 3 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
2	1	sbcbii 3808	. 2 ⊢ ([𝑍 / 𝑛]𝜓 ↔ [𝑍 / 𝑛]∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3		bnj92.2	. . 3 ⊢ 𝑍 ∈ V
4	3	bnj538 35099	. 2 ⊢ ([𝑍 / 𝑛]∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω [𝑍 / 𝑛](suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
5		sbcimg 3800	. . . . 5 ⊢ (𝑍 ∈ V → ([𝑍 / 𝑛](suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ([𝑍 / 𝑛]suc 𝑖 ∈ 𝑛 → [𝑍 / 𝑛](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))))
6	3, 5	ax-mp 5	. . . 4 ⊢ ([𝑍 / 𝑛](suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ([𝑍 / 𝑛]suc 𝑖 ∈ 𝑛 → [𝑍 / 𝑛](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
7		sbcel2gv 3818	. . . . . 6 ⊢ (𝑍 ∈ V → ([𝑍 / 𝑛]suc 𝑖 ∈ 𝑛 ↔ suc 𝑖 ∈ 𝑍))
8	3, 7	ax-mp 5	. . . . 5 ⊢ ([𝑍 / 𝑛]suc 𝑖 ∈ 𝑛 ↔ suc 𝑖 ∈ 𝑍)
9	3	bnj525 35097	. . . . 5 ⊢ ([𝑍 / 𝑛](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))
10	8, 9	imbi12i 353	. . . 4 ⊢ (([𝑍 / 𝑛]suc 𝑖 ∈ 𝑛 → [𝑍 / 𝑛](𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖 ∈ 𝑍 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
11	6, 10	bitri 278	. . 3 ⊢ ([𝑍 / 𝑛](suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖 ∈ 𝑍 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
12	11	ralbii 3118	. 2 ⊢ (∀𝑖 ∈ ω [𝑍 / 𝑛](suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑍 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
13	2, 4, 12	3bitri 300	1 ⊢ ([𝑍 / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑍 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1568   ∈ wcel 2150  ∀wral 3086  Vcvv 3462  [wsbc 3752  ∪ ciun 4961  suc csuc 6366  ‘cfv 6540  ωcom 7865   predc-bnj14 35047

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2199  ax-12 2220  ax-ext 2742

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1571  df-ex 1808  df-nf 1812  df-sb 2099  df-clab 2749  df-cleq 2762  df-clel 2845  df-nfc 2919  df-ral 3087  df-v 3464  df-sbc 3753

This theorem is referenced by:  bnj106  35226  bnj153  35238