![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > enp1iOLD | Structured version Visualization version GIF version |
Description: Obsolete version of enp1i 9181 as of 6-Jan-2025. (Contributed by Mario Carneiro, 5-Jan-2016.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
enp1iOLD.1 | ⊢ 𝑀 ∈ ω |
enp1iOLD.2 | ⊢ 𝑁 = suc 𝑀 |
enp1iOLD.3 | ⊢ ((𝐴 ∖ {𝑥}) ≈ 𝑀 → 𝜑) |
enp1iOLD.4 | ⊢ (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) |
Ref | Expression |
---|---|
enp1iOLD | ⊢ (𝐴 ≈ 𝑁 → ∃𝑥𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nsuceq0 6398 | . . . . 5 ⊢ suc 𝑀 ≠ ∅ | |
2 | breq1 5106 | . . . . . . 7 ⊢ (𝐴 = ∅ → (𝐴 ≈ 𝑁 ↔ ∅ ≈ 𝑁)) | |
3 | enp1iOLD.2 | . . . . . . . 8 ⊢ 𝑁 = suc 𝑀 | |
4 | ensym 8901 | . . . . . . . . 9 ⊢ (∅ ≈ 𝑁 → 𝑁 ≈ ∅) | |
5 | en0 8915 | . . . . . . . . 9 ⊢ (𝑁 ≈ ∅ ↔ 𝑁 = ∅) | |
6 | 4, 5 | sylib 217 | . . . . . . . 8 ⊢ (∅ ≈ 𝑁 → 𝑁 = ∅) |
7 | 3, 6 | eqtr3id 2791 | . . . . . . 7 ⊢ (∅ ≈ 𝑁 → suc 𝑀 = ∅) |
8 | 2, 7 | syl6bi 252 | . . . . . 6 ⊢ (𝐴 = ∅ → (𝐴 ≈ 𝑁 → suc 𝑀 = ∅)) |
9 | 8 | necon3ad 2954 | . . . . 5 ⊢ (𝐴 = ∅ → (suc 𝑀 ≠ ∅ → ¬ 𝐴 ≈ 𝑁)) |
10 | 1, 9 | mpi 20 | . . . 4 ⊢ (𝐴 = ∅ → ¬ 𝐴 ≈ 𝑁) |
11 | 10 | con2i 139 | . . 3 ⊢ (𝐴 ≈ 𝑁 → ¬ 𝐴 = ∅) |
12 | neq0 4303 | . . 3 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
13 | 11, 12 | sylib 217 | . 2 ⊢ (𝐴 ≈ 𝑁 → ∃𝑥 𝑥 ∈ 𝐴) |
14 | 3 | breq2i 5111 | . . . . 5 ⊢ (𝐴 ≈ 𝑁 ↔ 𝐴 ≈ suc 𝑀) |
15 | enp1iOLD.1 | . . . . . . . 8 ⊢ 𝑀 ∈ ω | |
16 | dif1ennn 9063 | . . . . . . . 8 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑥 ∈ 𝐴) → (𝐴 ∖ {𝑥}) ≈ 𝑀) | |
17 | 15, 16 | mp3an1 1448 | . . . . . . 7 ⊢ ((𝐴 ≈ suc 𝑀 ∧ 𝑥 ∈ 𝐴) → (𝐴 ∖ {𝑥}) ≈ 𝑀) |
18 | enp1iOLD.3 | . . . . . . 7 ⊢ ((𝐴 ∖ {𝑥}) ≈ 𝑀 → 𝜑) | |
19 | 17, 18 | syl 17 | . . . . . 6 ⊢ ((𝐴 ≈ suc 𝑀 ∧ 𝑥 ∈ 𝐴) → 𝜑) |
20 | 19 | ex 413 | . . . . 5 ⊢ (𝐴 ≈ suc 𝑀 → (𝑥 ∈ 𝐴 → 𝜑)) |
21 | 14, 20 | sylbi 216 | . . . 4 ⊢ (𝐴 ≈ 𝑁 → (𝑥 ∈ 𝐴 → 𝜑)) |
22 | enp1iOLD.4 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) | |
23 | 21, 22 | sylcom 30 | . . 3 ⊢ (𝐴 ≈ 𝑁 → (𝑥 ∈ 𝐴 → 𝜓)) |
24 | 23 | eximdv 1920 | . 2 ⊢ (𝐴 ≈ 𝑁 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥𝜓)) |
25 | 13, 24 | mpd 15 | 1 ⊢ (𝐴 ≈ 𝑁 → ∃𝑥𝜓) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ≠ wne 2941 ∖ cdif 3905 ∅c0 4280 {csn 4584 class class class wbr 5103 suc csuc 6317 ωcom 7794 ≈ cen 8838 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7664 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6318 df-on 6319 df-suc 6321 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-om 7795 df-er 8606 df-en 8842 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |