| 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 2380. (Contributed by NM, 2-Jan-2002.) Remove dependency on ax-11 2168. (Revised by Wolf Lammen, 8-Sep-2018.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dveeq1 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfeqf1 2387 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑦 = 𝑧) | |
| 2 | 1 | nf5rd 2208 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1545 |
| 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 ax-13 2380 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 df-nf 1791 |
| This theorem is referenced by: nfeqf 2389 axc11n 2434 |
| Copyright terms: Public domain | W3C validator |