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

Theorem omsinds 7602
Description: Strong (or "total") induction principle over the finite ordinals. (Contributed by Scott Fenton, 17-Jul-2015.)
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 7586 . . 3 ω ⊆ On
2 epweon 7499 . . 3 E We On
3 wess 5544 . . 3 (ω ⊆ On → ( E We On → E We ω))
41, 2, 3mp2 9 . 2 E We ω
5 epse 5540 . 2 E Se ω
6 omsinds.1 . 2 (𝑥 = 𝑦 → (𝜑𝜓))
7 omsinds.2 . 2 (𝑥 = 𝐴 → (𝜑𝜒))
8 predep 6176 . . . . 5 (𝑥 ∈ ω → Pred( E , ω, 𝑥) = (ω ∩ 𝑥))
9 ordom 7591 . . . . . . 7 Ord ω
10 ordtr 6207 . . . . . . 7 (Ord ω → Tr ω)
11 trss 5183 . . . . . . 7 (Tr ω → (𝑥 ∈ ω → 𝑥 ⊆ ω))
129, 10, 11mp2b 10 . . . . . 6 (𝑥 ∈ ω → 𝑥 ⊆ ω)
13 sseqin2 4194 . . . . . 6 (𝑥 ⊆ ω ↔ (ω ∩ 𝑥) = 𝑥)
1412, 13sylib 220 . . . . 5 (𝑥 ∈ ω → (ω ∩ 𝑥) = 𝑥)
158, 14eqtrd 2858 . . . 4 (𝑥 ∈ ω → Pred( E , ω, 𝑥) = 𝑥)
1615raleqdv 3417 . . 3 (𝑥 ∈ ω → (∀𝑦 ∈ Pred ( E , ω, 𝑥)𝜓 ↔ ∀𝑦𝑥 𝜓))
17 omsinds.3 . . 3 (𝑥 ∈ ω → (∀𝑦𝑥 𝜓𝜑))
1816, 17sylbid 242 . 2 (𝑥 ∈ ω → (∀𝑦 ∈ Pred ( E , ω, 𝑥)𝜓𝜑))
194, 5, 6, 7, 18wfis3 6191 1 (𝐴 ∈ ω → 𝜒)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1537  wcel 2114  wral 3140  cin 3937  wss 3938  Tr wtr 5174   E cep 5466   We wwe 5515  Predcpred 6149  Ord word 6192  Oncon0 6193  ωcom 7582
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-tr 5175  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-om 7583
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator