| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dveeq2-o | Structured version Visualization version GIF version | ||
| Description: Quantifier introduction when one pair of variables is distinct. Version of dveeq2 2416 using ax-c15 39552. (Contributed by NM, 2-Jan-2002.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dveeq2-o | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-5 1937 | . 2 ⊢ (𝑧 = 𝑤 → ∀𝑥 𝑧 = 𝑤) | |
| 2 | ax-5 1937 | . 2 ⊢ (𝑧 = 𝑦 → ∀𝑤 𝑧 = 𝑦) | |
| 3 | equequ2 2053 | . 2 ⊢ (𝑤 = 𝑦 → (𝑧 = 𝑤 ↔ 𝑧 = 𝑦)) | |
| 4 | 1, 2, 3 | dvelimf-o 39592 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑧 = 𝑦 → ∀𝑥 𝑧 = 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1565 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-10 2182 ax-11 2198 ax-12 2219 ax-13 2410 ax-c5 39546 ax-c4 39547 ax-c7 39548 ax-c10 39549 ax-c11 39550 ax-c9 39553 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-ex 1807 df-nf 1811 |
| This theorem is referenced by: ax12eq 39604 ax12el 39605 ax12inda 39611 ax12v2-o 39612 |
| Copyright terms: Public domain | W3C validator |