| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > equs5 | Structured version Visualization version GIF version | ||
| Description: Lemma used in proofs of substitution properties. If there is a disjoint variable condition on 𝑥, 𝑦, then sbalex 2281 can be used instead; if 𝑦 is not free in 𝜑, then equs45f 2493 can be used. Usage of this theorem is discouraged because it depends on ax-13 2406. (Contributed by NM, 14-May-1993.) (Revised by BJ, 1-Oct-2018.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| equs5 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfna1 2190 | . . 3 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦 | |
| 2 | nfa1 2189 | . . 3 ⊢ Ⅎ𝑥∀𝑥(𝑥 = 𝑦 → 𝜑) | |
| 3 | axc15 2456 | . . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))) | |
| 4 | 3 | impd 416 | . . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| 5 | 1, 2, 4 | exlimd 2257 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| 6 | equs4 2450 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) | |
| 7 | 5, 6 | impbid1 228 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 ∃wex 1812 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-10 2179 ax-12 2216 ax-13 2406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ex 1813 df-nf 1817 |
| This theorem is used by: sb3b 2510 bj-sbsb 37529 |
| Copyright terms: Public domain | W3C validator |