| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 19.8aw | Structured version Visualization version GIF version | ||
| Description: If a formula is true, then it is true for at least one instance. This is to 19.8a 2217 what spw 2066 is to sp 2219. (Contributed by SN, 26-Sep-2024.) |
| Ref | Expression |
|---|---|
| 19.8aw.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| 19.8aw | ⊢ (𝜑 → ∃𝑥𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | alnex 1813 | . . 3 ⊢ (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑) | |
| 2 | 19.8aw.1 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 3 | 2 | notbid 321 | . . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝜑 ↔ ¬ 𝜓)) |
| 4 | 3 | spw 2066 | . . 3 ⊢ (∀𝑥 ¬ 𝜑 → ¬ 𝜑) |
| 5 | 1, 4 | sylbir 238 | . 2 ⊢ (¬ ∃𝑥𝜑 → ¬ 𝜑) |
| 6 | 5 | con4i 115 | 1 ⊢ (𝜑 → ∃𝑥𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∀wal 1567 ∃wex 1811 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1812 |
| This theorem is used by: mo2icl 3671 dmcosseq 5959 eu6w 43688 |
| Copyright terms: Public domain | W3C validator |