Theorem axdc3lem3 10511

Description: Simple substitution lemma for axdc3 10513. (Contributed by Mario Carneiro, 27-Jan-2013.)

Hypotheses

Ref	Expression
axdc3lem3.1	⊢ 𝐴 ∈ V
axdc3lem3.2	⊢ 𝑆 = {𝑠 ∣ ∃𝑛 ∈ ω (𝑠:suc 𝑛⟶𝐴 ∧ (𝑠‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝑠‘suc 𝑘) ∈ (𝐹‘(𝑠‘𝑘)))}
axdc3lem3.3	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
axdc3lem3	⊢ (𝐵 ∈ 𝑆 ↔ ∃𝑚 ∈ ω (𝐵:suc 𝑚⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑚 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))))

Distinct variable groups:   𝐴,𝑚,𝑛   𝐴,𝑠,𝑛   𝐵,𝑘,𝑚,𝑛   𝐵,𝑠,𝑘   𝐶,𝑚,𝑛   𝐶,𝑠   𝑚,𝐹,𝑛   𝐹,𝑠

Allowed substitution hints:   𝐴(𝑘)   𝐶(𝑘)   𝑆(𝑘, 𝑚, 𝑛, 𝑠)   𝐹(𝑘)

Proof of Theorem axdc3lem3

Step	Hyp	Ref	Expression
1		axdc3lem3.2	. . 3 ⊢ 𝑆 = {𝑠 ∣ ∃𝑛 ∈ ω (𝑠:suc 𝑛⟶𝐴 ∧ (𝑠‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝑠‘suc 𝑘) ∈ (𝐹‘(𝑠‘𝑘)))}
2	1	eleq2i 2853	. 2 ⊢ (𝐵 ∈ 𝑆 ↔ 𝐵 ∈ {𝑠 ∣ ∃𝑛 ∈ ω (𝑠:suc 𝑛⟶𝐴 ∧ (𝑠‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝑠‘suc 𝑘) ∈ (𝐹‘(𝑠‘𝑘)))})
3		axdc3lem3.3	. . 3 ⊢ 𝐵 ∈ V
4		feq1 6679	. . . . 5 ⊢ (𝑠 = 𝐵 → (𝑠:suc 𝑛⟶𝐴 ↔ 𝐵:suc 𝑛⟶𝐴))
5		fveq1 6876	. . . . . 6 ⊢ (𝑠 = 𝐵 → (𝑠‘∅) = (𝐵‘∅))
6	5	eqeq1d 2763	. . . . 5 ⊢ (𝑠 = 𝐵 → ((𝑠‘∅) = 𝐶 ↔ (𝐵‘∅) = 𝐶))
7		fveq1 6876	. . . . . . 7 ⊢ (𝑠 = 𝐵 → (𝑠‘suc 𝑘) = (𝐵‘suc 𝑘))
8		fveq1 6876	. . . . . . . 8 ⊢ (𝑠 = 𝐵 → (𝑠‘𝑘) = (𝐵‘𝑘))
9	8	fveq2d 6881	. . . . . . 7 ⊢ (𝑠 = 𝐵 → (𝐹‘(𝑠‘𝑘)) = (𝐹‘(𝐵‘𝑘)))
10	7, 9	eleq12d 2855	. . . . . 6 ⊢ (𝑠 = 𝐵 → ((𝑠‘suc 𝑘) ∈ (𝐹‘(𝑠‘𝑘)) ↔ (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))))
11	10	ralbidv 3186	. . . . 5 ⊢ (𝑠 = 𝐵 → (∀𝑘 ∈ 𝑛 (𝑠‘suc 𝑘) ∈ (𝐹‘(𝑠‘𝑘)) ↔ ∀𝑘 ∈ 𝑛 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))))
12	4, 6, 11	3anbi123d 1464	. . . 4 ⊢ (𝑠 = 𝐵 → ((𝑠:suc 𝑛⟶𝐴 ∧ (𝑠‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝑠‘suc 𝑘) ∈ (𝐹‘(𝑠‘𝑘))) ↔ (𝐵:suc 𝑛⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘)))))
13	12	rexbidv 3187	. . 3 ⊢ (𝑠 = 𝐵 → (∃𝑛 ∈ ω (𝑠:suc 𝑛⟶𝐴 ∧ (𝑠‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝑠‘suc 𝑘) ∈ (𝐹‘(𝑠‘𝑘))) ↔ ∃𝑛 ∈ ω (𝐵:suc 𝑛⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘)))))
14	3, 13	elab 3633	. 2 ⊢ (𝐵 ∈ {𝑠 ∣ ∃𝑛 ∈ ω (𝑠:suc 𝑛⟶𝐴 ∧ (𝑠‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝑠‘suc 𝑘) ∈ (𝐹‘(𝑠‘𝑘)))} ↔ ∃𝑛 ∈ ω (𝐵:suc 𝑛⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))))
15		suceq 6424	. . . . 5 ⊢ (𝑛 = 𝑚 → suc 𝑛 = suc 𝑚)
16	15	feq2d 6685	. . . 4 ⊢ (𝑛 = 𝑚 → (𝐵:suc 𝑛⟶𝐴 ↔ 𝐵:suc 𝑚⟶𝐴))
17		raleq 3317	. . . 4 ⊢ (𝑛 = 𝑚 → (∀𝑘 ∈ 𝑛 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘)) ↔ ∀𝑘 ∈ 𝑚 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))))
18	16, 17	3anbi13d 1466	. . 3 ⊢ (𝑛 = 𝑚 → ((𝐵:suc 𝑛⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))) ↔ (𝐵:suc 𝑚⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑚 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘)))))
19	18	cbvrexvw 3242	. 2 ⊢ (∃𝑛 ∈ ω (𝐵:suc 𝑛⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑛 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))) ↔ ∃𝑚 ∈ ω (𝐵:suc 𝑚⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑚 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))))
20	2, 14, 19	3bitri 300	1 ⊢ (𝐵 ∈ 𝑆 ↔ ∃𝑚 ∈ ω (𝐵:suc 𝑚⟶𝐴 ∧ (𝐵‘∅) = 𝐶 ∧ ∀𝑘 ∈ 𝑚 (𝐵‘suc 𝑘) ∈ (𝐹‘(𝐵‘𝑘))))

This proof depends on syntax axioms:   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077  ∃wrex 3087  Vcvv 3451  ∅c0 4279  suc csuc 6357  ⟶wf 6527  ‘cfv 6531  ωcom 7866

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539

This theorem is used by:  axdc3lem4  10512