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

Theorem tfinds2 7909
Description: Transfinite Induction (inference schema), using implicit substitutions. The first three hypotheses establish the substitutions we need. The last three are the basis and the induction hypotheses (for successor and limit ordinals respectively). Theorem Schema 4 of [Suppes] p. 197. The wff 𝜏 is an auxiliary antecedent to help shorten proofs using this theorem. (Contributed by NM, 4-Sep-2004.)
Hypotheses
Ref Expression
tfinds2.1 (𝑥 = ∅ → (𝜑 ↔ 𝜓))
tfinds2.2 (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
tfinds2.3 (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃))
tfinds2.4 (𝜏 → 𝜓)
tfinds2.5 (𝑦 ∈ On → (𝜏 → (𝜒 → 𝜃)))
tfinds2.6 (Lim 𝑥 → (𝜏 → (∀𝑦 ∈ 𝑥 𝜒 → 𝜑)))
Assertion
Ref Expression
tfinds2 (𝑥 ∈ On → (𝜏 → 𝜑))
Distinct variable groups:   𝑥,𝑦,𝜏   𝜓,𝑥   𝜒,𝑥   𝜃,𝑥   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝜃(𝑦)

Proof of Theorem tfinds2
StepHypRef Expression
1 tfinds2.4 . . 3 (𝜏 → 𝜓)
2 0ex 5267 . . . 4 ∅ ∈ V
3 tfinds2.1 . . . . 5 (𝑥 = ∅ → (𝜑 ↔ 𝜓))
43imbi2d 343 . . . 4 (𝑥 = ∅ → ((𝜏 → 𝜑) ↔ (𝜏 → 𝜓)))
52, 4sbcie 3783 . . 3 ([∅ / 𝑥](𝜏 → 𝜑) ↔ (𝜏 → 𝜓))
61, 5mpbir 234 . 2 [∅ / 𝑥](𝜏 → 𝜑)
7 tfinds2.5 . . . . . . . 8 (𝑦 ∈ On → (𝜏 → (𝜒 → 𝜃)))
87a2d 30 . . . . . . 7 (𝑦 ∈ On → ((𝜏 → 𝜒) → (𝜏 → 𝜃)))
98sbcth 3757 . . . . . 6 (𝑥 ∈ V → [𝑥 / 𝑦](𝑦 ∈ On → ((𝜏 → 𝜒) → (𝜏 → 𝜃))))
109elv 3459 . . . . 5 [𝑥 / 𝑦](𝑦 ∈ On → ((𝜏 → 𝜒) → (𝜏 → 𝜃)))
11 sbcimg 3790 . . . . . 6 (𝑥 ∈ V → ([𝑥 / 𝑦](𝑦 ∈ On → ((𝜏 → 𝜒) → (𝜏 → 𝜃))) ↔ ([𝑥 / 𝑦]𝑦 ∈ On → [𝑥 / 𝑦]((𝜏 → 𝜒) → (𝜏 → 𝜃)))))
1211elv 3459 . . . . 5 ([𝑥 / 𝑦](𝑦 ∈ On → ((𝜏 → 𝜒) → (𝜏 → 𝜃))) ↔ ([𝑥 / 𝑦]𝑦 ∈ On → [𝑥 / 𝑦]((𝜏 → 𝜒) → (𝜏 → 𝜃))))
1310, 12mpbi 233 . . . 4 ([𝑥 / 𝑦]𝑦 ∈ On → [𝑥 / 𝑦]((𝜏 → 𝜒) → (𝜏 → 𝜃)))
14 sbcel1v 3807 . . . 4 ([𝑥 / 𝑦]𝑦 ∈ On ↔ 𝑥 ∈ On)
15 sbcimg 3790 . . . . 5 (𝑥 ∈ V → ([𝑥 / 𝑦]((𝜏 → 𝜒) → (𝜏 → 𝜃)) ↔ ([𝑥 / 𝑦](𝜏 → 𝜒) → [𝑥 / 𝑦](𝜏 → 𝜃))))
1615elv 3459 . . . 4 ([𝑥 / 𝑦]((𝜏 → 𝜒) → (𝜏 → 𝜃)) ↔ ([𝑥 / 𝑦](𝜏 → 𝜒) → [𝑥 / 𝑦](𝜏 → 𝜃)))
1713, 14, 163imtr3i 294 . . 3 (𝑥 ∈ On → ([𝑥 / 𝑦](𝜏 → 𝜒) → [𝑥 / 𝑦](𝜏 → 𝜃)))
18 vex 3458 . . . 4 𝑥 ∈ V
19 tfinds2.2 . . . . . . 7 (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
2019bicomd 226 . . . . . 6 (𝑥 = 𝑦 → (𝜒 ↔ 𝜑))
2120equcoms 2055 . . . . 5 (𝑦 = 𝑥 → (𝜒 ↔ 𝜑))
2221imbi2d 343 . . . 4 (𝑦 = 𝑥 → ((𝜏 → 𝜒) ↔ (𝜏 → 𝜑)))
2318, 22sbcie 3783 . . 3 ([𝑥 / 𝑦](𝜏 → 𝜒) ↔ (𝜏 → 𝜑))
24 vex 3458 . . . . . . 7 𝑦 ∈ V
2524sucex 7854 . . . . . 6 suc 𝑦 ∈ V
26 tfinds2.3 . . . . . . 7 (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃))
2726imbi2d 343 . . . . . 6 (𝑥 = suc 𝑦 → ((𝜏 → 𝜑) ↔ (𝜏 → 𝜃)))
2825, 27sbcie 3783 . . . . 5 ([suc 𝑦 / 𝑥](𝜏 → 𝜑) ↔ (𝜏 → 𝜃))
2928sbcbii 3798 . . . 4 ([𝑥 / 𝑦][suc 𝑦 / 𝑥](𝜏 → 𝜑) ↔ [𝑥 / 𝑦](𝜏 → 𝜃))
30 suceq 6457 . . . . 5 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
3130sbcco2 3769 . . . 4 ([𝑥 / 𝑦][suc 𝑦 / 𝑥](𝜏 → 𝜑) ↔ [suc 𝑥 / 𝑥](𝜏 → 𝜑))
3229, 31bitr3i 280 . . 3 ([𝑥 / 𝑦](𝜏 → 𝜃) ↔ [suc 𝑥 / 𝑥](𝜏 → 𝜑))
3317, 23, 323imtr3g 298 . 2 (𝑥 ∈ On → ((𝜏 → 𝜑) → [suc 𝑥 / 𝑥](𝜏 → 𝜑)))
3419imbi2d 343 . . . . 5 (𝑥 = 𝑦 → ((𝜏 → 𝜑) ↔ (𝜏 → 𝜒)))
3534sbralie 3342 . . . 4 (∀𝑥 ∈ 𝑦 (𝜏 → 𝜑) ↔ [𝑦 / 𝑥]∀𝑦 ∈ 𝑥 (𝜏 → 𝜒))
36 sbsbc 3746 . . . 4 ([𝑦 / 𝑥]∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) ↔ [𝑦 / 𝑥]∀𝑦 ∈ 𝑥 (𝜏 → 𝜒))
3735, 36bitr2i 279 . . 3 ([𝑦 / 𝑥]∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) ↔ ∀𝑥 ∈ 𝑦 (𝜏 → 𝜑))
38 r19.21v 3191 . . . . . . . 8 (∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) ↔ (𝜏 → ∀𝑦 ∈ 𝑥 𝜒))
39 tfinds2.6 . . . . . . . . 9 (Lim 𝑥 → (𝜏 → (∀𝑦 ∈ 𝑥 𝜒 → 𝜑)))
4039a2d 30 . . . . . . . 8 (Lim 𝑥 → ((𝜏 → ∀𝑦 ∈ 𝑥 𝜒) → (𝜏 → 𝜑)))
4138, 40biimtrid 245 . . . . . . 7 (Lim 𝑥 → (∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑)))
4241sbcth 3757 . . . . . 6 (𝑦 ∈ V → [𝑦 / 𝑥](Lim 𝑥 → (∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑))))
4342elv 3459 . . . . 5 [𝑦 / 𝑥](Lim 𝑥 → (∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑)))
44 sbcimg 3790 . . . . . 6 (𝑦 ∈ V → ([𝑦 / 𝑥](Lim 𝑥 → (∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑))) ↔ ([𝑦 / 𝑥]Lim 𝑥 → [𝑦 / 𝑥](∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑)))))
4544elv 3459 . . . . 5 ([𝑦 / 𝑥](Lim 𝑥 → (∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑))) ↔ ([𝑦 / 𝑥]Lim 𝑥 → [𝑦 / 𝑥](∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑))))
4643, 45mpbi 233 . . . 4 ([𝑦 / 𝑥]Lim 𝑥 → [𝑦 / 𝑥](∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑)))
47 limeq 6400 . . . . 5 (𝑥 = 𝑦 → (Lim 𝑥 ↔ Lim 𝑦))
4824, 47sbcie 3783 . . . 4 ([𝑦 / 𝑥]Lim 𝑥 ↔ Lim 𝑦)
49 sbcimg 3790 . . . . 5 (𝑦 ∈ V → ([𝑦 / 𝑥](∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑)) ↔ ([𝑦 / 𝑥]∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → [𝑦 / 𝑥](𝜏 → 𝜑))))
5049elv 3459 . . . 4 ([𝑦 / 𝑥](∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → (𝜏 → 𝜑)) ↔ ([𝑦 / 𝑥]∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → [𝑦 / 𝑥](𝜏 → 𝜑)))
5146, 48, 503imtr3i 294 . . 3 (Lim 𝑦 → ([𝑦 / 𝑥]∀𝑦 ∈ 𝑥 (𝜏 → 𝜒) → [𝑦 / 𝑥](𝜏 → 𝜑)))
5237, 51biimtrrid 246 . 2 (Lim 𝑦 → (∀𝑥 ∈ 𝑦 (𝜏 → 𝜑) → [𝑦 / 𝑥](𝜏 → 𝜑)))
536, 33, 52tfindes 7908 1 (𝑥 ∈ On → (𝜏 → 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570  [wsb 2101   ∈ wcel 2147  ∀wral 3080  Vcvv 3454  [wsbc 3742  ∅c0 4281  Oncon0 6388  Lim wlim 6389  suc csuc 6390
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394
This theorem is used by:  inar1  10899  grur1a  10943
  Copyright terms: Public domain W3C validator