| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > speivw | Structured version Visualization version GIF version | ||
| Description: Version of spei 2425 with a disjoint variable condition, which does not require ax-13 2403 (neither ax-7 2037 nor ax-12 2212). (Contributed by BJ, 31-May-2019.) |
| Ref | Expression |
|---|---|
| speivw.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| speivw.2 | ⊢ 𝜓 |
| Ref | Expression |
|---|---|
| speivw | ⊢ ∃𝑥𝜑 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | speivw.1 | . . 3 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 2 | 1 | biimprd 251 | . 2 ⊢ (𝑥 = 𝑦 → (𝜓 → 𝜑)) |
| 3 | speivw.2 | . 2 ⊢ 𝜓 | |
| 4 | 2, 3 | speiv 2001 | 1 ⊢ ∃𝑥𝜑 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∃wex 1808 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-6 1996 |
| This proof depends on definitions: df-bi 210 df-ex 1809 |
| This theorem is used by: elirrvOLDOLD 9559 bnj1014 35358 eusnsn 47791 |
| Copyright terms: Public domain | W3C validator |