| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dveeq2 | 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 2382. (Contributed by NM, 2-Jan-2002.) (Revised by NM, 20-Jul-2015.) Remove dependency on ax-11 2170. (Revised by Wolf Lammen, 8-Sep-2018.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dveeq2 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfeqf2 2387 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑧 = 𝑦) | |
| 2 | 1 | nf5rd 2210 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1546 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-10 2154 ax-12 2191 ax-13 2382 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-ex 1788 df-nf 1792 |
| This theorem is referenced by: axc15 2432 axsepg2 35336 axsepg4 35339 axnulg 35341 axpowg2 35343 axpowg3 35344 |
| Copyright terms: Public domain | W3C validator |