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

Theorem tfinds2 7804
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 5250 . . . 4 ∅ ∈ V
3 tfinds2.1 . . . . 5 (𝑥 = ∅ → (𝜑𝜓))
43imbi2d 340 . . . 4 (𝑥 = ∅ → ((𝜏𝜑) ↔ (𝜏𝜓)))
52, 4sbcie 3780 . . 3 ([∅ / 𝑥](𝜏𝜑) ↔ (𝜏𝜓))
61, 5mpbir 231 . 2 [∅ / 𝑥](𝜏𝜑)
7 tfinds2.5 . . . . . . . 8 (𝑦 ∈ On → (𝜏 → (𝜒𝜃)))
87a2d 29 . . . . . . 7 (𝑦 ∈ On → ((𝜏𝜒) → (𝜏𝜃)))
98sbcth 3753 . . . . . 6 (𝑥 ∈ V → [𝑥 / 𝑦](𝑦 ∈ On → ((𝜏𝜒) → (𝜏𝜃))))
109elv 3443 . . . . 5 [𝑥 / 𝑦](𝑦 ∈ On → ((𝜏𝜒) → (𝜏𝜃)))
11 sbcimg 3787 . . . . . 6 (𝑥 ∈ V → ([𝑥 / 𝑦](𝑦 ∈ On → ((𝜏𝜒) → (𝜏𝜃))) ↔ ([𝑥 / 𝑦]𝑦 ∈ On → [𝑥 / 𝑦]((𝜏𝜒) → (𝜏𝜃)))))
1211elv 3443 . . . . 5 ([𝑥 / 𝑦](𝑦 ∈ On → ((𝜏𝜒) → (𝜏𝜃))) ↔ ([𝑥 / 𝑦]𝑦 ∈ On → [𝑥 / 𝑦]((𝜏𝜒) → (𝜏𝜃))))
1310, 12mpbi 230 . . . 4 ([𝑥 / 𝑦]𝑦 ∈ On → [𝑥 / 𝑦]((𝜏𝜒) → (𝜏𝜃)))
14 sbcel1v 3804 . . . 4 ([𝑥 / 𝑦]𝑦 ∈ On ↔ 𝑥 ∈ On)
15 sbcimg 3787 . . . . 5 (𝑥 ∈ V → ([𝑥 / 𝑦]((𝜏𝜒) → (𝜏𝜃)) ↔ ([𝑥 / 𝑦](𝜏𝜒) → [𝑥 / 𝑦](𝜏𝜃))))
1615elv 3443 . . . 4 ([𝑥 / 𝑦]((𝜏𝜒) → (𝜏𝜃)) ↔ ([𝑥 / 𝑦](𝜏𝜒) → [𝑥 / 𝑦](𝜏𝜃)))
1713, 14, 163imtr3i 291 . . 3 (𝑥 ∈ On → ([𝑥 / 𝑦](𝜏𝜒) → [𝑥 / 𝑦](𝜏𝜃)))
18 vex 3442 . . . 4 𝑥 ∈ V
19 tfinds2.2 . . . . . . 7 (𝑥 = 𝑦 → (𝜑𝜒))
2019bicomd 223 . . . . . 6 (𝑥 = 𝑦 → (𝜒𝜑))
2120equcoms 2021 . . . . 5 (𝑦 = 𝑥 → (𝜒𝜑))
2221imbi2d 340 . . . 4 (𝑦 = 𝑥 → ((𝜏𝜒) ↔ (𝜏𝜑)))
2318, 22sbcie 3780 . . 3 ([𝑥 / 𝑦](𝜏𝜒) ↔ (𝜏𝜑))
24 vex 3442 . . . . . . 7 𝑦 ∈ V
2524sucex 7749 . . . . . 6 suc 𝑦 ∈ V
26 tfinds2.3 . . . . . . 7 (𝑥 = suc 𝑦 → (𝜑𝜃))
2726imbi2d 340 . . . . . 6 (𝑥 = suc 𝑦 → ((𝜏𝜑) ↔ (𝜏𝜃)))
2825, 27sbcie 3780 . . . . 5 ([suc 𝑦 / 𝑥](𝜏𝜑) ↔ (𝜏𝜃))
2928sbcbii 3795 . . . 4 ([𝑥 / 𝑦][suc 𝑦 / 𝑥](𝜏𝜑) ↔ [𝑥 / 𝑦](𝜏𝜃))
30 suceq 6383 . . . . 5 (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
3130sbcco2 3765 . . . 4 ([𝑥 / 𝑦][suc 𝑦 / 𝑥](𝜏𝜑) ↔ [suc 𝑥 / 𝑥](𝜏𝜑))
3229, 31bitr3i 277 . . 3 ([𝑥 / 𝑦](𝜏𝜃) ↔ [suc 𝑥 / 𝑥](𝜏𝜑))
3317, 23, 323imtr3g 295 . 2 (𝑥 ∈ On → ((𝜏𝜑) → [suc 𝑥 / 𝑥](𝜏𝜑)))
3419imbi2d 340 . . . . 5 (𝑥 = 𝑦 → ((𝜏𝜑) ↔ (𝜏𝜒)))
3534sbralie 3320 . . . 4 (∀𝑥𝑦 (𝜏𝜑) ↔ [𝑦 / 𝑥]∀𝑦𝑥 (𝜏𝜒))
36 sbsbc 3742 . . . 4 ([𝑦 / 𝑥]∀𝑦𝑥 (𝜏𝜒) ↔ [𝑦 / 𝑥]𝑦𝑥 (𝜏𝜒))
3735, 36bitr2i 276 . . 3 ([𝑦 / 𝑥]𝑦𝑥 (𝜏𝜒) ↔ ∀𝑥𝑦 (𝜏𝜑))
38 r19.21v 3159 . . . . . . . 8 (∀𝑦𝑥 (𝜏𝜒) ↔ (𝜏 → ∀𝑦𝑥 𝜒))
39 tfinds2.6 . . . . . . . . 9 (Lim 𝑥 → (𝜏 → (∀𝑦𝑥 𝜒𝜑)))
4039a2d 29 . . . . . . . 8 (Lim 𝑥 → ((𝜏 → ∀𝑦𝑥 𝜒) → (𝜏𝜑)))
4138, 40biimtrid 242 . . . . . . 7 (Lim 𝑥 → (∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑)))
4241sbcth 3753 . . . . . 6 (𝑦 ∈ V → [𝑦 / 𝑥](Lim 𝑥 → (∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑))))
4342elv 3443 . . . . 5 [𝑦 / 𝑥](Lim 𝑥 → (∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑)))
44 sbcimg 3787 . . . . . 6 (𝑦 ∈ V → ([𝑦 / 𝑥](Lim 𝑥 → (∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑))) ↔ ([𝑦 / 𝑥]Lim 𝑥[𝑦 / 𝑥](∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑)))))
4544elv 3443 . . . . 5 ([𝑦 / 𝑥](Lim 𝑥 → (∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑))) ↔ ([𝑦 / 𝑥]Lim 𝑥[𝑦 / 𝑥](∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑))))
4643, 45mpbi 230 . . . 4 ([𝑦 / 𝑥]Lim 𝑥[𝑦 / 𝑥](∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑)))
47 limeq 6327 . . . . 5 (𝑥 = 𝑦 → (Lim 𝑥 ↔ Lim 𝑦))
4824, 47sbcie 3780 . . . 4 ([𝑦 / 𝑥]Lim 𝑥 ↔ Lim 𝑦)
49 sbcimg 3787 . . . . 5 (𝑦 ∈ V → ([𝑦 / 𝑥](∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑)) ↔ ([𝑦 / 𝑥]𝑦𝑥 (𝜏𝜒) → [𝑦 / 𝑥](𝜏𝜑))))
5049elv 3443 . . . 4 ([𝑦 / 𝑥](∀𝑦𝑥 (𝜏𝜒) → (𝜏𝜑)) ↔ ([𝑦 / 𝑥]𝑦𝑥 (𝜏𝜒) → [𝑦 / 𝑥](𝜏𝜑)))
5146, 48, 503imtr3i 291 . . 3 (Lim 𝑦 → ([𝑦 / 𝑥]𝑦𝑥 (𝜏𝜒) → [𝑦 / 𝑥](𝜏𝜑)))
5237, 51biimtrrid 243 . 2 (Lim 𝑦 → (∀𝑥𝑦 (𝜏𝜑) → [𝑦 / 𝑥](𝜏𝜑)))
536, 33, 52tfindes 7803 1 (𝑥 ∈ On → (𝜏𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1541  [wsb 2067  wcel 2113  wral 3049  Vcvv 3438  [wsbc 3738  c0 4283  Oncon0 6315  Lim wlim 6316  suc csuc 6317
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-tr 5204  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321
This theorem is referenced by:  inar1  10684  grur1a  10728
  Copyright terms: Public domain W3C validator