| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > equs45f | Structured version Visualization version GIF version | ||
| Description: Two ways of expressing substitution when 𝑦 is not free in 𝜑. The implication "to the left" is equs4 2447 and does not require the nonfreeness hypothesis. Theorem sbalex 2277 replaces the nonfreeness hypothesis with a disjoint variable condition and equs5 2491 replaces it with a distinctor antecedent. (Contributed by NM, 25-Apr-2008.) (Revised by Mario Carneiro, 4-Oct-2016.) Usage of this theorem is discouraged because it depends on ax-13 2403. Use sbalex 2277 instead. (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| equs45f.1 | ⊢ Ⅎ𝑦𝜑 |
| Ref | Expression |
|---|---|
| equs45f | ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equs45f.1 | . . . . . 6 ⊢ Ⅎ𝑦𝜑 | |
| 2 | 1 | nf5ri 2230 | . . . . 5 ⊢ (𝜑 → ∀𝑦𝜑) |
| 3 | 2 | anim2i 626 | . . . 4 ⊢ ((𝑥 = 𝑦 ∧ 𝜑) → (𝑥 = 𝑦 ∧ ∀𝑦𝜑)) |
| 4 | 3 | eximi 1855 | . . 3 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑)) |
| 5 | equs5a 2488 | . . 3 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑)) | |
| 6 | 4, 5 | syl 17 | . 2 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| 7 | equs4 2447 | . 2 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) | |
| 8 | 6, 7 | impbii 211 | 1 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∀wal 1558 ∃wex 1799 Ⅎwnf 1803 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-10 2175 ax-12 2212 ax-13 2403 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-ex 1800 df-nf 1804 |
| This theorem is referenced by: sb5f 2529 |
| Copyright terms: Public domain | W3C validator |