Theorem tfis 4567

Description: Transfinite Induction Schema. If all ordinal numbers less than a given number 𝑥 have a property (induction hypothesis), then all ordinal numbers have the property (conclusion). Exercise 25 of [Enderton] p. 200. (Contributed by NM, 1-Aug-1994.) (Revised by Mario Carneiro, 20-Nov-2016.)

Hypothesis

Ref	Expression
tfis.1	⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑))

Assertion

Ref	Expression
tfis	⊢ (𝑥 ∈ On → 𝜑)

Distinct variable groups:   𝜑,𝑦   𝑥,𝑦

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem tfis

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 3232	. . . . 5 ⊢ {𝑥 ∈ On ∣ 𝜑} ⊆ On
2		nfcv 2312	. . . . . . 7 ⊢ Ⅎ𝑥𝑧
3		nfrab1 2649	. . . . . . . . 9 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ 𝜑}
4	2, 3	nfss 3140	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑}
5	3	nfcri 2306	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑}
6	4, 5	nfim 1565	. . . . . . 7 ⊢ Ⅎ𝑥(𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑})
7		dfss3 3137	. . . . . . . . 9 ⊢ (𝑥 ⊆ {𝑥 ∈ On ∣ 𝜑} ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑})
8		sseq1 3170	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑥 ⊆ {𝑥 ∈ On ∣ 𝜑} ↔ 𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑}))
9	7, 8	bitr3id 193	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} ↔ 𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑}))
10		rabid 2645	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑥 ∈ On ∣ 𝜑} ↔ (𝑥 ∈ On ∧ 𝜑))
11		eleq1 2233	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ {𝑥 ∈ On ∣ 𝜑} ↔ 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑}))
12	10, 11	bitr3id 193	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ On ∧ 𝜑) ↔ 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑}))
13	9, 12	imbi12d 233	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ((∀𝑦 ∈ 𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → (𝑥 ∈ On ∧ 𝜑)) ↔ (𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑})))
14		sbequ 1833	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑦 → ([𝑤 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
15		nfcv 2312	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥On
16		nfcv 2312	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑤On
17		nfv 1521	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑤𝜑
18		nfs1v 1932	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥[𝑤 / 𝑥]𝜑
19		sbequ12 1764	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (𝜑 ↔ [𝑤 / 𝑥]𝜑))
20	15, 16, 17, 18, 19	cbvrab 2728	. . . . . . . . . . . 12 ⊢ {𝑥 ∈ On ∣ 𝜑} = {𝑤 ∈ On ∣ [𝑤 / 𝑥]𝜑}
21	14, 20	elrab2 2889	. . . . . . . . . . 11 ⊢ (𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} ↔ (𝑦 ∈ On ∧ [𝑦 / 𝑥]𝜑))
22	21	simprbi 273	. . . . . . . . . 10 ⊢ (𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → [𝑦 / 𝑥]𝜑)
23	22	ralimi 2533	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → ∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑)
24		tfis.1	. . . . . . . . 9 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑))
25	23, 24	syl5 32	. . . . . . . 8 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → 𝜑))
26	25	anc2li 327	. . . . . . 7 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → (𝑥 ∈ On ∧ 𝜑)))
27	2, 6, 13, 26	vtoclgaf 2795	. . . . . 6 ⊢ (𝑧 ∈ On → (𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑}))
28	27	rgen 2523	. . . . 5 ⊢ ∀𝑧 ∈ On (𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑})
29		tfi 4566	. . . . 5 ⊢ (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ ∀𝑧 ∈ On (𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑})) → {𝑥 ∈ On ∣ 𝜑} = On)
30	1, 28, 29	mp2an 424	. . . 4 ⊢ {𝑥 ∈ On ∣ 𝜑} = On
31	30	eqcomi 2174	. . 3 ⊢ On = {𝑥 ∈ On ∣ 𝜑}
32	31	rabeq2i 2727	. 2 ⊢ (𝑥 ∈ On ↔ (𝑥 ∈ On ∧ 𝜑))
33	32	simprbi 273	1 ⊢ (𝑥 ∈ On → 𝜑)

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1348  [wsb 1755   ∈ wcel 2141  ∀wral 2448  {crab 2452   ⊆ wss 3121  Oncon0 4348

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152  ax-setind 4521

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-in 3127  df-ss 3134  df-uni 3797  df-tr 4088  df-iord 4351  df-on 4353

This theorem is referenced by:  tfis2f  4568