| 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 9175 and related theorems. (Contributed by Mario Carneiro, 5-Jan-2016.) Generalize to all ordinals and avoid ax-pow 5307, ax-un 7677. (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 5103 | . 2 ⊢ (𝐴 ≈ 𝑁 ↔ 𝐴 ≈ suc 𝑀) |
| 3 | enp1i.1 | . . . . 5 ⊢ Ord 𝑀 | |
| 4 | encv 8887 | . . . . . . 7 ⊢ (𝐴 ≈ suc 𝑀 → (𝐴 ∈ V ∧ suc 𝑀 ∈ V)) | |
| 5 | 4 | simprd 495 | . . . . . 6 ⊢ (𝐴 ≈ suc 𝑀 → suc 𝑀 ∈ V) |
| 6 | sssucid 6396 | . . . . . . 7 ⊢ 𝑀 ⊆ suc 𝑀 | |
| 7 | ssexg 5265 | . . . . . . 7 ⊢ ((𝑀 ⊆ suc 𝑀 ∧ suc 𝑀 ∈ V) → 𝑀 ∈ V) | |
| 8 | 6, 7 | mpan 690 | . . . . . 6 ⊢ (suc 𝑀 ∈ V → 𝑀 ∈ V) |
| 9 | elong 6322 | . . . . . 6 ⊢ (𝑀 ∈ V → (𝑀 ∈ On ↔ Ord 𝑀)) | |
| 10 | 5, 8, 9 | 3syl 18 | . . . . 5 ⊢ (𝐴 ≈ suc 𝑀 → (𝑀 ∈ On ↔ Ord 𝑀)) |
| 11 | 3, 10 | mpbiri 258 | . . . 4 ⊢ (𝐴 ≈ suc 𝑀 → 𝑀 ∈ On) |
| 12 | rexdif1en 9081 | . . . 4 ⊢ ((𝑀 ∈ On ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀) | |
| 13 | 11, 12 | mpancom 688 | . . 3 ⊢ (𝐴 ≈ suc 𝑀 → ∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀) |
| 14 | enp1i.3 | . . . 4 ⊢ ((𝐴 ∖ {𝑥}) ≈ 𝑀 → 𝜑) | |
| 15 | 14 | reximi 3071 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀 → ∃𝑥 ∈ 𝐴 𝜑) |
| 16 | df-rex 3058 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 17 | enp1i.4 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) | |
| 18 | 17 | imp 406 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝜓) |
| 19 | 18 | eximi 1836 | . . . 4 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃𝑥𝜓) |
| 20 | 16, 19 | sylbi 217 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → ∃𝑥𝜓) |
| 21 | 13, 15, 20 | 3syl 18 | . 2 ⊢ (𝐴 ≈ suc 𝑀 → ∃𝑥𝜓) |
| 22 | 2, 21 | sylbi 217 | 1 ⊢ (𝐴 ≈ 𝑁 → ∃𝑥𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2113 ∃wrex 3057 Vcvv 3437 ∖ cdif 3895 ⊆ wss 3898 {csn 4577 class class class wbr 5095 Ord word 6313 Oncon0 6314 suc csuc 6316 ≈ cen 8876 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-ne 2930 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-br 5096 df-opab 5158 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-ord 6317 df-on 6318 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-en 8880 |
| This theorem is referenced by: en2 9175 en3 9176 en4 9177 |
| Copyright terms: Public domain | W3C validator |