| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dveeq1-o | Structured version Visualization version GIF version | ||
| Description: Quantifier introduction when one pair of variables is distinct. Version of dveeq1 2415 using ax-c11 . (Contributed by NM, 2-Jan-2002.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dveeq1-o | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-5 1943 | . 2 ⊢ (𝑤 = 𝑧 → ∀𝑥 𝑤 = 𝑧) | |
| 2 | ax-5 1943 | . 2 ⊢ (𝑦 = 𝑧 → ∀𝑤 𝑦 = 𝑧) | |
| 3 | equequ1 2058 | . 2 ⊢ (𝑤 = 𝑦 → (𝑤 = 𝑧 ↔ 𝑦 = 𝑧)) | |
| 4 | 1, 2, 3 | dvelimf-o 39744 | 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-11 2195 ax-12 2216 ax-13 2407 ax-c5 39698 ax-c4 39699 ax-c7 39700 ax-c10 39701 ax-c11 39702 ax-c9 39705 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 |
| This theorem is used by: ax12inda2ALT 39761 |
| Copyright terms: Public domain | W3C validator |