| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wfi | Structured version Visualization version GIF version | ||
| Description: The Principle of Well-Ordered Induction. Theorem 6.27 of [TakeutiZaring] p. 32. This principle states that if 𝐵 is a subclass of a well-ordered class 𝐴 with the property that every element of 𝐵 whose inital segment is included in 𝐴 is itself equal to 𝐴. (Contributed by Scott Fenton, 29-Jan-2011.) (Revised by Mario Carneiro, 26-Jun-2015.) (Proof shortened by Scott Fenton, 17-Nov-2024.) |
| Ref | Expression |
|---|---|
| wfi | ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵 → 𝑦 ∈ 𝐵))) → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wefr 5608 | . . . 4 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | |
| 2 | 1 | adantr 481 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Fr 𝐴) |
| 3 | weso 5609 | . . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
| 4 | sopo 5545 | . . . . 5 ⊢ (𝑅 Or 𝐴 → 𝑅 Po 𝐴) | |
| 5 | 3, 4 | syl 17 | . . . 4 ⊢ (𝑅 We 𝐴 → 𝑅 Po 𝐴) |
| 6 | 5 | adantr 481 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Po 𝐴) |
| 7 | simpr 485 | . . 3 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → 𝑅 Se 𝐴) | |
| 8 | 2, 6, 7 | 3jca 1134 | . 2 ⊢ ((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) → (𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴)) |
| 9 | frpoind 6293 | . 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵 → 𝑦 ∈ 𝐵))) → 𝐴 = 𝐵) | |
| 10 | 8, 9 | sylan 586 | 1 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (Pred(𝑅, 𝐴, 𝑦) ⊆ 𝐵 → 𝑦 ∈ 𝐵))) → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ∀wral 3053 ⊆ wss 3883 Po wpo 5524 Or wor 5525 Fr wfr 5568 Se wse 5569 We wwe 5570 Predcpred 6251 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-br 5073 df-opab 5135 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-cnv 5626 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 |
| This theorem is referenced by: wfii 6301 |
| Copyright terms: Public domain | W3C validator |