Theorem bnj106 34874

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

Hypotheses

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

Assertion

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

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

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

Proof of Theorem bnj106

Step	Hyp	Ref	Expression
1		bnj106.1	. . . 4 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
2		bnj105 34730	. . . 4 ⊢ 1o ∈ V
3	1, 2	bnj92 34868	. . 3 ⊢ ([1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
4	3	sbcbii 3853	. 2 ⊢ ([𝐹 / 𝑓][1o / 𝑛]𝜓 ↔ [𝐹 / 𝑓]∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
5		bnj106.2	. . 3 ⊢ 𝐹 ∈ V
6		fveq1 6910	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘suc 𝑖) = (𝐹‘suc 𝑖))
7		fveq1 6910	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑖) = (𝐹‘𝑖))
8	7	bnj1113 34791	. . . . . 6 ⊢ (𝑓 = 𝐹 → ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))
9	6, 8	eqeq12d 2752	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))
10	9	imbi2d 340	. . . 4 ⊢ (𝑓 = 𝐹 → ((suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))))
11	10	ralbidv 3177	. . 3 ⊢ (𝑓 = 𝐹 → (∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))))
12	5, 11	sbcie 3836	. 2 ⊢ ([𝐹 / 𝑓]∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))
13	4, 12	bitri 275	1 ⊢ ([𝐹 / 𝑓][1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1538   ∈ wcel 2107  ∀wral 3060  Vcvv 3479  [wsbc 3792  ∪ ciun 4997  suc csuc 6391  ‘cfv 6566  ωcom 7891  1_oc1o 8504   predc-bnj14 34694

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 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5303  ax-nul 5313  ax-pow 5372

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1541  df-fal 1551  df-ex 1778  df-nf 1782  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ral 3061  df-rex 3070  df-v 3481  df-sbc 3793  df-dif 3967  df-un 3969  df-ss 3981  df-nul 4341  df-pw 4608  df-sn 4633  df-uni 4914  df-iun 4999  df-br 5150  df-suc 6395  df-iota 6519  df-fv 6574  df-1o 8511

This theorem is referenced by:  bnj126  34879