Theorem tfi 6945

Description: The Principle of Transfinite Induction. Theorem 7.17 of [TakeutiZaring] p. 39. This principle states that if 𝐴 is a class of ordinal numbers with the property that every ordinal number included in 𝐴 also belongs to 𝐴, then every ordinal number is in 𝐴.

See theorem tfindes 6954 or tfinds 6951 for the version involving basis and induction hypotheses. (Contributed by NM, 18-Feb-2004.)

Assertion

Ref	Expression
tfi	⊢ ((𝐴 ⊆ On ∧ ∀𝑥 ∈ On (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) → 𝐴 = On)

Distinct variable group:   𝑥,𝐴

Proof of Theorem tfi

Step	Hyp	Ref	Expression
1		eldifn 3695	. . . . . . . . 9 ⊢ (𝑥 ∈ (On ∖ 𝐴) → ¬ 𝑥 ∈ 𝐴)
2	1	adantl 481	. . . . . . . 8 ⊢ (((𝑥 ∈ On → (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) ∧ 𝑥 ∈ (On ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴)
3		eldifi 3694	. . . . . . . . . 10 ⊢ (𝑥 ∈ (On ∖ 𝐴) → 𝑥 ∈ On)
4		onss 6882	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ On → 𝑥 ⊆ On)
5		difin0ss 3900	. . . . . . . . . . . . 13 ⊢ (((On ∖ 𝐴) ∩ 𝑥) = ∅ → (𝑥 ⊆ On → 𝑥 ⊆ 𝐴))
6	4, 5	syl5com 31	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ On → (((On ∖ 𝐴) ∩ 𝑥) = ∅ → 𝑥 ⊆ 𝐴))
7	6	imim1d 80	. . . . . . . . . . 11 ⊢ (𝑥 ∈ On → ((𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴) → (((On ∖ 𝐴) ∩ 𝑥) = ∅ → 𝑥 ∈ 𝐴)))
8	7	a2i 14	. . . . . . . . . 10 ⊢ ((𝑥 ∈ On → (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) → (𝑥 ∈ On → (((On ∖ 𝐴) ∩ 𝑥) = ∅ → 𝑥 ∈ 𝐴)))
9	3, 8	syl5 33	. . . . . . . . 9 ⊢ ((𝑥 ∈ On → (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) → (𝑥 ∈ (On ∖ 𝐴) → (((On ∖ 𝐴) ∩ 𝑥) = ∅ → 𝑥 ∈ 𝐴)))
10	9	imp 444	. . . . . . . 8 ⊢ (((𝑥 ∈ On → (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) ∧ 𝑥 ∈ (On ∖ 𝐴)) → (((On ∖ 𝐴) ∩ 𝑥) = ∅ → 𝑥 ∈ 𝐴))
11	2, 10	mtod 188	. . . . . . 7 ⊢ (((𝑥 ∈ On → (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) ∧ 𝑥 ∈ (On ∖ 𝐴)) → ¬ ((On ∖ 𝐴) ∩ 𝑥) = ∅)
12	11	ex 449	. . . . . 6 ⊢ ((𝑥 ∈ On → (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) → (𝑥 ∈ (On ∖ 𝐴) → ¬ ((On ∖ 𝐴) ∩ 𝑥) = ∅))
13	12	ralimi2 2933	. . . . 5 ⊢ (∀𝑥 ∈ On (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴) → ∀𝑥 ∈ (On ∖ 𝐴) ¬ ((On ∖ 𝐴) ∩ 𝑥) = ∅)
14		ralnex 2975	. . . . 5 ⊢ (∀𝑥 ∈ (On ∖ 𝐴) ¬ ((On ∖ 𝐴) ∩ 𝑥) = ∅ ↔ ¬ ∃𝑥 ∈ (On ∖ 𝐴)((On ∖ 𝐴) ∩ 𝑥) = ∅)
15	13, 14	sylib 207	. . . 4 ⊢ (∀𝑥 ∈ On (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴) → ¬ ∃𝑥 ∈ (On ∖ 𝐴)((On ∖ 𝐴) ∩ 𝑥) = ∅)
16		ssdif0 3896	. . . . . 6 ⊢ (On ⊆ 𝐴 ↔ (On ∖ 𝐴) = ∅)
17	16	necon3bbii 2829	. . . . 5 ⊢ (¬ On ⊆ 𝐴 ↔ (On ∖ 𝐴) ≠ ∅)
18		ordon 6874	. . . . . 6 ⊢ Ord On
19		difss 3699	. . . . . 6 ⊢ (On ∖ 𝐴) ⊆ On
20		tz7.5 5661	. . . . . 6 ⊢ ((Ord On ∧ (On ∖ 𝐴) ⊆ On ∧ (On ∖ 𝐴) ≠ ∅) → ∃𝑥 ∈ (On ∖ 𝐴)((On ∖ 𝐴) ∩ 𝑥) = ∅)
21	18, 19, 20	mp3an12 1406	. . . . 5 ⊢ ((On ∖ 𝐴) ≠ ∅ → ∃𝑥 ∈ (On ∖ 𝐴)((On ∖ 𝐴) ∩ 𝑥) = ∅)
22	17, 21	sylbi 206	. . . 4 ⊢ (¬ On ⊆ 𝐴 → ∃𝑥 ∈ (On ∖ 𝐴)((On ∖ 𝐴) ∩ 𝑥) = ∅)
23	15, 22	nsyl2 141	. . 3 ⊢ (∀𝑥 ∈ On (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴) → On ⊆ 𝐴)
24	23	anim2i 591	. 2 ⊢ ((𝐴 ⊆ On ∧ ∀𝑥 ∈ On (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) → (𝐴 ⊆ On ∧ On ⊆ 𝐴))
25		eqss 3583	. 2 ⊢ (𝐴 = On ↔ (𝐴 ⊆ On ∧ On ⊆ 𝐴))
26	24, 25	sylibr 223	1 ⊢ ((𝐴 ⊆ On ∧ ∀𝑥 ∈ On (𝑥 ⊆ 𝐴 → 𝑥 ∈ 𝐴)) → 𝐴 = On)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  ∃wrex 2897   ∖ cdif 3537   ∩ cin 3539   ⊆ wss 3540  ∅c0 3874  Ord word 5639  Oncon0 5640

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-tr 4681  df-eprel 4949  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-ord 5643  df-on 5644

This theorem is referenced by:  tfis  6946  tfisg  30960  onsetrec  42250