| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > equs5av | Structured version Visualization version GIF version | ||
| Description: A property related to substitution that replaces the distinctor from equs5 2468 to a disjoint variable condition. Version of equs5a 2465 with a disjoint variable condition, which does not require ax-13 2380. See also sbalex 2254. (Contributed by NM, 2-Feb-2007.) (Revised by GG, 15-Dec-2023.) |
| Ref | Expression |
|---|---|
| equs5av | ⊢ (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfa1 2162 | . 2 ⊢ Ⅎ𝑥∀𝑥(𝑥 = 𝑦 → 𝜑) | |
| 2 | ax12v2 2191 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) | |
| 3 | 2 | spsd 2199 | . . 3 ⊢ (𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| 4 | 3 | imp 407 | . 2 ⊢ ((𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| 5 | 1, 4 | exlimi 2229 | 1 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∀wal 1545 ∃wex 1786 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-10 2152 ax-12 2189 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-ex 1787 df-nf 1791 |
| This theorem is referenced by: bj-equs45fv 37171 |
| Copyright terms: Public domain | W3C validator |