| 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 9247 and related theorems. (Contributed by Mario Carneiro, 5-Jan-2016.) Generalize to all ordinals and avoid ax-pow 5338, ax-un 7742. (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 5119 | . 2 ⊢ (𝐴 ≈ 𝑁 ↔ 𝐴 ≈ suc 𝑀) |
| 3 | enp1i.1 | . . . . 5 ⊢ Ord 𝑀 | |
| 4 | encv 8957 | . . . . . . 7 ⊢ (𝐴 ≈ suc 𝑀 → (𝐴 ∈ V ∧ suc 𝑀 ∈ V)) | |
| 5 | 4 | simprd 501 | . . . . . 6 ⊢ (𝐴 ≈ suc 𝑀 → suc 𝑀 ∈ V) |
| 6 | sssucid 6447 | . . . . . . 7 ⊢ 𝑀 ⊆ suc 𝑀 | |
| 7 | ssexg 5292 | . . . . . . 7 ⊢ ((𝑀 ⊆ suc 𝑀 ∧ suc 𝑀 ∈ V) → 𝑀 ∈ V) | |
| 8 | 6, 7 | mpan 703 | . . . . . 6 ⊢ (suc 𝑀 ∈ V → 𝑀 ∈ V) |
| 9 | elong 6372 | . . . . . 6 ⊢ (𝑀 ∈ V → (𝑀 ∈ On ↔ Ord 𝑀)) | |
| 10 | 5, 8, 9 | 3syl 19 | . . . . 5 ⊢ (𝐴 ≈ suc 𝑀 → (𝑀 ∈ On ↔ Ord 𝑀)) |
| 11 | 3, 10 | mpbiri 261 | . . . 4 ⊢ (𝐴 ≈ suc 𝑀 → 𝑀 ∈ On) |
| 12 | rexdif1en 9152 | . . . 4 ⊢ ((𝑀 ∈ On ∧ 𝐴 ≈ suc 𝑀) → ∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀) | |
| 13 | 11, 12 | mpancom 701 | . . 3 ⊢ (𝐴 ≈ suc 𝑀 → ∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀) |
| 14 | enp1i.3 | . . . 4 ⊢ ((𝐴 ∖ {𝑥}) ≈ 𝑀 → 𝜑) | |
| 15 | 14 | reximi 3105 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 (𝐴 ∖ {𝑥}) ≈ 𝑀 → ∃𝑥 ∈ 𝐴 𝜑) |
| 16 | df-rex 3092 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 17 | enp1i.4 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) | |
| 18 | 17 | imp 412 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝜓) |
| 19 | 18 | eximi 1868 | . . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2146 ∃wrex 3091 Vcvv 3457 ∖ cdif 3903 ⊆ wss 3906 {csn 4591 class class class wbr 5111 Ord word 6363 Oncon0 6364 suc csuc 6366 ≈ cen 8946 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-en 8950 |
| This theorem is used by: en2 9247 en3 9248 en4 9249 |
| Copyright terms: Public domain | W3C validator |