![]() |
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 9341 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 6478 | . . . . 5 ⊢ suc 𝑀 ≠ ∅ | |
2 | breq1 5169 | . . . . . . 7 ⊢ (𝐴 = ∅ → (𝐴 ≈ 𝑁 ↔ ∅ ≈ 𝑁)) | |
3 | enp1iOLD.2 | . . . . . . . 8 ⊢ 𝑁 = suc 𝑀 | |
4 | ensym 9063 | . . . . . . . . 9 ⊢ (∅ ≈ 𝑁 → 𝑁 ≈ ∅) | |
5 | en0 9078 | . . . . . . . . 9 ⊢ (𝑁 ≈ ∅ ↔ 𝑁 = ∅) | |
6 | 4, 5 | sylib 218 | . . . . . . . 8 ⊢ (∅ ≈ 𝑁 → 𝑁 = ∅) |
7 | 3, 6 | eqtr3id 2794 | . . . . . . 7 ⊢ (∅ ≈ 𝑁 → suc 𝑀 = ∅) |
8 | 2, 7 | biimtrdi 253 | . . . . . 6 ⊢ (𝐴 = ∅ → (𝐴 ≈ 𝑁 → suc 𝑀 = ∅)) |
9 | 8 | necon3ad 2959 | . . . . 5 ⊢ (𝐴 = ∅ → (suc 𝑀 ≠ ∅ → ¬ 𝐴 ≈ 𝑁)) |
10 | 1, 9 | mpi 20 | . . . 4 ⊢ (𝐴 = ∅ → ¬ 𝐴 ≈ 𝑁) |
11 | 10 | con2i 139 | . . 3 ⊢ (𝐴 ≈ 𝑁 → ¬ 𝐴 = ∅) |
12 | neq0 4375 | . . 3 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
13 | 11, 12 | sylib 218 | . 2 ⊢ (𝐴 ≈ 𝑁 → ∃𝑥 𝑥 ∈ 𝐴) |
14 | 3 | breq2i 5174 | . . . . 5 ⊢ (𝐴 ≈ 𝑁 ↔ 𝐴 ≈ suc 𝑀) |
15 | enp1iOLD.1 | . . . . . . . 8 ⊢ 𝑀 ∈ ω | |
16 | dif1ennn 9227 | . . . . . . . 8 ⊢ ((𝑀 ∈ ω ∧ 𝐴 ≈ suc 𝑀 ∧ 𝑥 ∈ 𝐴) → (𝐴 ∖ {𝑥}) ≈ 𝑀) | |
17 | 15, 16 | mp3an1 1448 | . . . . . . 7 ⊢ ((𝐴 ≈ suc 𝑀 ∧ 𝑥 ∈ 𝐴) → (𝐴 ∖ {𝑥}) ≈ 𝑀) |
18 | enp1iOLD.3 | . . . . . . 7 ⊢ ((𝐴 ∖ {𝑥}) ≈ 𝑀 → 𝜑) | |
19 | 17, 18 | syl 17 | . . . . . 6 ⊢ ((𝐴 ≈ suc 𝑀 ∧ 𝑥 ∈ 𝐴) → 𝜑) |
20 | 19 | ex 412 | . . . . 5 ⊢ (𝐴 ≈ suc 𝑀 → (𝑥 ∈ 𝐴 → 𝜑)) |
21 | 14, 20 | sylbi 217 | . . . 4 ⊢ (𝐴 ≈ 𝑁 → (𝑥 ∈ 𝐴 → 𝜑)) |
22 | enp1iOLD.4 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) | |
23 | 21, 22 | sylcom 30 | . . 3 ⊢ (𝐴 ≈ 𝑁 → (𝑥 ∈ 𝐴 → 𝜓)) |
24 | 23 | eximdv 1916 | . 2 ⊢ (𝐴 ≈ 𝑁 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥𝜓)) |
25 | 13, 24 | mpd 15 | 1 ⊢ (𝐴 ≈ 𝑁 → ∃𝑥𝜓) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1537 ∃wex 1777 ∈ wcel 2108 ≠ wne 2946 ∖ cdif 3973 ∅c0 4352 {csn 4648 class class class wbr 5166 suc csuc 6397 ωcom 7903 ≈ cen 9000 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-ord 6398 df-on 6399 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-om 7904 df-er 8763 df-en 9004 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |