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

Theorem omsinds 7924
Description: Strong (or "total") induction principle over the finite ordinals. (Contributed by Scott Fenton, 17-Jul-2015.) (Proof shortened by BJ, 16-Oct-2024.)
Hypotheses
Ref Expression
omsinds.1 (𝑥 = 𝑦 → (𝜑𝜓))
omsinds.2 (𝑥 = 𝐴 → (𝜑𝜒))
omsinds.3 (𝑥 ∈ ω → (∀𝑦𝑥 𝜓𝜑))
Assertion
Ref Expression
omsinds (𝐴 ∈ ω → 𝜒)
Distinct variable groups:   𝑥,𝐴   𝜒,𝑥   𝜑,𝑦   𝜓,𝑥   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝐴(𝑦)

Proof of Theorem omsinds
StepHypRef Expression
1 omsson 7907 . . 3 ω ⊆ On
2 epweon 7810 . . 3 E We On
3 wess 5686 . . 3 (ω ⊆ On → ( E We On → E We ω))
41, 2, 3mp2 9 . 2 E We ω
5 epse 5682 . 2 E Se ω
6 omsinds.1 . 2 (𝑥 = 𝑦 → (𝜑𝜓))
7 omsinds.2 . 2 (𝑥 = 𝐴 → (𝜑𝜒))
8 trom 7912 . . . . 5 Tr ω
9 trpred 6363 . . . . 5 ((Tr ω ∧ 𝑥 ∈ ω) → Pred( E , ω, 𝑥) = 𝑥)
108, 9mpan 689 . . . 4 (𝑥 ∈ ω → Pred( E , ω, 𝑥) = 𝑥)
1110raleqdv 3334 . . 3 (𝑥 ∈ ω → (∀𝑦 ∈ Pred ( E , ω, 𝑥)𝜓 ↔ ∀𝑦𝑥 𝜓))
12 omsinds.3 . . 3 (𝑥 ∈ ω → (∀𝑦𝑥 𝜓𝜑))
1311, 12sylbid 240 . 2 (𝑥 ∈ ω → (∀𝑦 ∈ Pred ( E , ω, 𝑥)𝜓𝜑))
144, 5, 6, 7, 13wfis3 6393 1 (𝐴 ∈ ω → 𝜒)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1537  wcel 2108  wral 3067  wss 3976  Tr wtr 5283   E cep 5598   We wwe 5651  Predcpred 6331  Oncon0 6395  ωcom 7903
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-tr 5284  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-se 5653  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-om 7904
This theorem is referenced by:  madefi  27968
  Copyright terms: Public domain W3C validator