MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tfis Structured version   Visualization version   GIF version

Theorem tfis 7839
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.
StepHypRef Expression
1 ssrab2 4036 . . . . 5 {𝑥 ∈ On ∣ 𝜑} ⊆ On
2 nfcv 2927 . . . . . . 7 𝑥𝑧
3 nfrab1 3437 . . . . . . . . 9 𝑥{𝑥 ∈ On ∣ 𝜑}
42, 3nfss 3932 . . . . . . . 8 𝑥 𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑}
53nfcri 2919 . . . . . . . 8 𝑥 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑}
64, 5nfim 1919 . . . . . . 7 𝑥(𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑})
7 dfss3 3928 . . . . . . . . 9 (𝑥 ⊆ {𝑥 ∈ On ∣ 𝜑} ↔ ∀𝑦𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑})
8 sseq1 3964 . . . . . . . . 9 (𝑥 = 𝑧 → (𝑥 ⊆ {𝑥 ∈ On ∣ 𝜑} ↔ 𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑}))
97, 8bitr3id 288 . . . . . . . 8 (𝑥 = 𝑧 → (∀𝑦𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} ↔ 𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑}))
10 rabid 3438 . . . . . . . . 9 (𝑥 ∈ {𝑥 ∈ On ∣ 𝜑} ↔ (𝑥 ∈ On ∧ 𝜑))
11 eleq1w 2848 . . . . . . . . 9 (𝑥 = 𝑧 → (𝑥 ∈ {𝑥 ∈ On ∣ 𝜑} ↔ 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑}))
1210, 11bitr3id 288 . . . . . . . 8 (𝑥 = 𝑧 → ((𝑥 ∈ On ∧ 𝜑) ↔ 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑}))
139, 12imbi12d 347 . . . . . . 7 (𝑥 = 𝑧 → ((∀𝑦𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → (𝑥 ∈ On ∧ 𝜑)) ↔ (𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑})))
14 sbequ 2119 . . . . . . . . . . . 12 (𝑤 = 𝑦 → ([𝑤 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
15 nfcv 2927 . . . . . . . . . . . . 13 𝑥On
16 nfcv 2927 . . . . . . . . . . . . 13 𝑤On
17 nfv 1937 . . . . . . . . . . . . 13 𝑤𝜑
18 nfs1v 2193 . . . . . . . . . . . . 13 𝑥[𝑤 / 𝑥]𝜑
19 sbequ12 2289 . . . . . . . . . . . . 13 (𝑥 = 𝑤 → (𝜑 ↔ [𝑤 / 𝑥]𝜑))
2015, 16, 17, 18, 19cbvrabw 3452 . . . . . . . . . . . 12 {𝑥 ∈ On ∣ 𝜑} = {𝑤 ∈ On ∣ [𝑤 / 𝑥]𝜑}
2114, 20elrab2 3657 . . . . . . . . . . 11 (𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} ↔ (𝑦 ∈ On ∧ [𝑦 / 𝑥]𝜑))
2221simprbi 502 . . . . . . . . . 10 (𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → [𝑦 / 𝑥]𝜑)
2322ralimi 3102 . . . . . . . . 9 (∀𝑦𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → ∀𝑦𝑥 [𝑦 / 𝑥]𝜑)
24 tfis.1 . . . . . . . . 9 (𝑥 ∈ On → (∀𝑦𝑥 [𝑦 / 𝑥]𝜑𝜑))
2523, 24syl5 35 . . . . . . . 8 (𝑥 ∈ On → (∀𝑦𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → 𝜑))
2625anc2li 564 . . . . . . 7 (𝑥 ∈ On → (∀𝑦𝑥 𝑦 ∈ {𝑥 ∈ On ∣ 𝜑} → (𝑥 ∈ On ∧ 𝜑)))
272, 6, 13, 26vtoclgaf 3543 . . . . . 6 (𝑧 ∈ On → (𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑}))
2827rgen 3081 . . . . 5 𝑧 ∈ On (𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑})
29 tfi 7837 . . . . 5 (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ ∀𝑧 ∈ On (𝑧 ⊆ {𝑥 ∈ On ∣ 𝜑} → 𝑧 ∈ {𝑥 ∈ On ∣ 𝜑})) → {𝑥 ∈ On ∣ 𝜑} = On)
301, 28, 29mp2an 704 . . . 4 {𝑥 ∈ On ∣ 𝜑} = On
3130eqcomi 2774 . . 3 On = {𝑥 ∈ On ∣ 𝜑}
3231reqabi 3440 . 2 (𝑥 ∈ On ↔ (𝑥 ∈ On ∧ 𝜑))
3332simprbi 502 1 (𝑥 ∈ On → 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  [wsb 2093  wcel 2145  wral 3079  {crab 3417  wss 3907  Oncon0 6350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-tr 5213  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-ord 6353  df-on 6354
This theorem is referenced by:  tfis2f  7840
  Copyright terms: Public domain W3C validator