| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wfisg | Structured version Visualization version GIF version | ||
| Description: Well-Ordered Induction Schema. If a property passes from all elements less than 𝑦 of a well-ordered class 𝐴 to 𝑦 itself (induction hypothesis), then the property holds for all elements of 𝐴. (Contributed by Scott Fenton, 11-Feb-2011.) (Proof shortened by Scott Fenton, 17-Nov-2024.) |
| Ref | Expression |
|---|---|
| wfisg.1 | ⊢ (𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑)) |
| Ref | Expression |
|---|---|
| wfisg | ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wefr 5637 | . . 3 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | |
| 2 | 1 | adantr 484 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Fr 𝐴) |
| 3 | weso 5638 | . . . 4 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
| 4 | sopo 5574 | . . . 4 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
| 5 | 3, 4 | syl 17 | . . 3 ⊢ (𝑅 We 𝐴 → 𝑅 Po 𝐴) |
| 6 | 5 | adantr 484 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Po 𝐴) |
| 7 | simpr 488 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴) | |
| 8 | wfisg.1 | . . . 4 ⊢ (𝑦 ∈ 𝐴 → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑)) | |
| 9 | 8 | adantl 485 | . . 3 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ 𝑦 ∈ 𝐴) → (∀𝑧 ∈ Pred (𝑅, 𝐴, 𝑦)[𝑧 / 𝑦]𝜑 → 𝜑)) |
| 10 | 9 | frpoinsg 6330 | . 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑) |
| 11 | 2, 6, 7, 10 | syl3anc 1390 | 1 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → ∀𝑦 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1098 ∈ wcel 2142 ∀wral 3076 [wsbc 3744 Po wpo 5553 Or wor 5554 Fr wfr 5597 Se wse 5598 We wwe 5599 Predcpred 6287 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-sbc 3745 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-po 5555 df-so 5556 df-fr 5600 df-se 5601 df-we 5602 df-xp 5653 df-cnv 5655 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 |
| This theorem is referenced by: wfis 6339 |
| Copyright terms: Public domain | W3C validator |