![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > omsinds | Structured version Visualization version GIF version |
Description: Strong (or "total") induction principle over the finite ordinals. (Contributed by Scott Fenton, 17-Jul-2015.) (Proof shortened by BJ, 16-Oct-2024.) |
Ref | Expression |
---|---|
omsinds.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
omsinds.2 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜒)) |
omsinds.3 | ⊢ (𝑥 ∈ ω → (∀𝑦 ∈ 𝑥 𝜓 → 𝜑)) |
Ref | Expression |
---|---|
omsinds | ⊢ (𝐴 ∈ ω → 𝜒) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | omsson 7798 | . . 3 ⊢ ω ⊆ On | |
2 | epweon 7701 | . . 3 ⊢ E We On | |
3 | wess 5618 | . . 3 ⊢ (ω ⊆ On → ( E We On → E We ω)) | |
4 | 1, 2, 3 | mp2 9 | . 2 ⊢ E We ω |
5 | epse 5614 | . 2 ⊢ E Se ω | |
6 | omsinds.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
7 | omsinds.2 | . 2 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜒)) | |
8 | trom 7803 | . . . . 5 ⊢ Tr ω | |
9 | trpred 6283 | . . . . 5 ⊢ ((Tr ω ∧ 𝑥 ∈ ω) → Pred( E , ω, 𝑥) = 𝑥) | |
10 | 8, 9 | mpan 688 | . . . 4 ⊢ (𝑥 ∈ ω → Pred( E , ω, 𝑥) = 𝑥) |
11 | 10 | raleqdv 3311 | . . 3 ⊢ (𝑥 ∈ ω → (∀𝑦 ∈ Pred ( E , ω, 𝑥)𝜓 ↔ ∀𝑦 ∈ 𝑥 𝜓)) |
12 | omsinds.3 | . . 3 ⊢ (𝑥 ∈ ω → (∀𝑦 ∈ 𝑥 𝜓 → 𝜑)) | |
13 | 11, 12 | sylbid 239 | . 2 ⊢ (𝑥 ∈ ω → (∀𝑦 ∈ Pred ( E , ω, 𝑥)𝜓 → 𝜑)) |
14 | 4, 5, 6, 7, 13 | wfis3 6313 | 1 ⊢ (𝐴 ∈ ω → 𝜒) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1541 ∈ wcel 2106 ∀wral 3062 ⊆ wss 3908 Tr wtr 5220 E cep 5534 We wwe 5585 Predcpred 6250 Oncon0 6315 ωcom 7794 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5254 ax-nul 5261 ax-pr 5382 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3406 df-v 3445 df-sbc 3738 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-br 5104 df-opab 5166 df-tr 5221 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-se 5587 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6251 df-ord 6318 df-on 6319 df-lim 6320 df-om 7795 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |