| 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 2406. (Contributed by NM, 2-Jan-2002.) Remove dependency on ax-11 2194. (Revised by Wolf Lammen, 8-Sep-2018.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dveeq1 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfeqf1 2413 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑦 = 𝑧) | |
| 2 | 1 | nf5rd 2234 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1561 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-10 2178 ax-12 2215 ax-13 2406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1803 df-nf 1807 |
| This theorem is referenced by: nfeqf 2415 axc11n 2460 |
| Copyright terms: Public domain | W3C validator |