| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dveeq1 | Structured version Visualization version GIF version | ||
| Description: Quantifier introduction when one pair of variables is distinct. Usage of this theorem is discouraged because it depends on ax-13 2407. (Contributed by NM, 2-Jan-2002.) Remove dependency on ax-11 2195. (Revised by Wolf Lammen, 8-Sep-2018.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dveeq1 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfeqf1 2414 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑦 = 𝑧) | |
| 2 | 1 | nf5rd 2235 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∀wal 1568 |
| 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 2407 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-nf 1817 |
| This theorem is used by: nfeqf 2416 axc11n 2461 |
| Copyright terms: Public domain | W3C validator |