Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > equsexv | Structured version Visualization version GIF version |
Description: An equivalence related to implicit substitution. Version of equsex 2413 with a disjoint variable condition, which does not require ax-13 2367. See equsexvw 2004 for a version with two disjoint variable conditions requiring fewer axioms. See also the dual form equsalv 2254. (Contributed by NM, 5-Aug-1993.) (Revised by BJ, 31-May-2019.) Avoid ax-10 2132. (Revised by Gino Giotto, 18-Nov-2024.) |
Ref | Expression |
---|---|
equsalv.nf | ⊢ Ⅎ𝑥𝜓 |
equsalv.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
equsexv | ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equsalv.nf | . . 3 ⊢ Ⅎ𝑥𝜓 | |
2 | equsalv.1 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
3 | 2 | biimpa 476 | . . 3 ⊢ ((𝑥 = 𝑦 ∧ 𝜑) → 𝜓) |
4 | 1, 3 | exlimi 2205 | . 2 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → 𝜓) |
5 | 1, 2 | equsalv 2254 | . . 3 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜓) |
6 | equs4v 1999 | . . 3 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) | |
7 | 5, 6 | sylbir 234 | . 2 ⊢ (𝜓 → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) |
8 | 4, 7 | impbii 208 | 1 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∀wal 1535 ∃wex 1777 Ⅎwnf 1781 |
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-12 2166 |
This theorem depends on definitions: df-bi 206 df-an 396 df-ex 1778 df-nf 1782 |
This theorem is referenced by: sb5OLD 2264 equsexhv 2284 cleljustALT2 2358 sb10f 2527 dprd2d2 19675 poimirlem25 35830 |
Copyright terms: Public domain | W3C validator |