| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > enp1i | Structured version Visualization version GIF version | ||
| Description: Proof induction for en2 9236 and related theorems. (Contributed by Mario Carneiro, 5-Jan-2016.) Generalize to all ordinals and avoid ax-pow 5336, ax-un 7732. (Revised by BTernaryTau, 6-Jan-2025.) |
| Ref | Expression |
|---|---|
| enp1i.1 | ⊢ Ord 𝑀 |
| enp1i.2 | ⊢ 𝑁 = suc 𝑀 |
| enp1i.3 | ⊢ ((𝐴 ∖ {𝑥}) ≈ 𝑀 → 𝜑) |
| enp1i.4 | ⊢ (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) |
| Ref | Expression |
|---|---|
| enp1i | ⊢ (𝐴 ≈ 𝑁 → ∃𝑥𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | enp1i.2 | . . 3 ⊢ 𝑁 = suc 𝑀 | |
| 2 | 1 | breq2i 5117 | . 2 ⊢ (𝐴 ≈ 𝑁 ↔ 𝐴 ≈ suc 𝑀) |
| 3 | enp1i.1 | . . . . 5 ⊢ Ord 𝑀 | |
| 4 | encv 8947 | . . . . . . 7 ⊢ (𝐴 ≈ suc 𝑀 → (𝐴 ∈ V ∧ suc 𝑀 ∈ V)) | |
| 5 | 4 | simprd 500 | . . . . . 6 ⊢ (𝐴 ≈ suc 𝑀 → suc 𝑀 ∈ V) |
| 6 | sssucid 6443 | . . . . . . 7 ⊢ 𝑀 ⊆ suc 𝑀 | |
| 7 | ssexg 5290 | . . . . . . 7 ⊢ ((𝑀 ⊆ suc 𝑀 ∧ suc 𝑀 ∈ V) → 𝑀 ∈ V) | |
| 8 | 6, 7 | mpan 702 | . . . . . 6 ⊢ (suc 𝑀 ∈ V → 𝑀 ∈ V) |
| 9 | elong 6368 | . . . . . 6 ⊢ (𝑀 ∈ V → (𝑀 ∈ On ↔ Ord 𝑀)) | |
| 10 | 5, 8, 9 | 3syl 19 | . . . . 5 ⊢ (𝐴 ≈ suc 𝑀 → (𝑀 ∈ On ↔ Ord 𝑀)) |
| 11 | 3, 10 | mpbiri 261 | . . . 4 ⊢ (𝐴 ≈ suc 𝑀 → 𝑀 ∈ On) |
| 12 | rexdif1en 9141 | . . . 4 ⊢ ((𝑀 ∈ On ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀) | |
| 13 | 11, 12 | mpancom 700 | . . 3 ⊢ (𝐴 ≈ suc 𝑀 → ∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀) |
| 14 | enp1i.3 | . . . 4 ⊢ ((𝐴 ∖ {𝑥}) ≈ 𝑀 → 𝜑) | |
| 15 | 14 | reximi 3103 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀 → ∃𝑥 ∈ 𝐴 𝜑) |
| 16 | df-rex 3090 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 17 | enp1i.4 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) | |
| 18 | 17 | imp 411 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝜓) |
| 19 | 18 | eximi 1865 | . . . 4 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃𝑥𝜓) |
| 20 | 16, 19 | sylbi 220 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑥𝜓) |
| 21 | 13, 15, 20 | 3syl 19 | . 2 ⊢ (𝐴 ≈ suc 𝑀 → ∃𝑥𝜓) |
| 22 | 2, 21 | sylbi 220 | 1 ⊢ (𝐴 ≈ 𝑁 → ∃𝑥𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∃wex 1809 ∈ wcel 2143 ∃wrex 3089 Vcvv 3455 ∖ cdif 3902 ⊆ wss 3905 {csn 4589 class class class wbr 5109 Ord word 6359 Oncon0 6360 suc csuc 6362 ≈ cen 8936 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-ord 6363 df-on 6364 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-en 8940 |
| This theorem is referenced by: en2 9236 en3 9237 en4 9238 |
| Copyright terms: Public domain | W3C validator |