| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > axextbdist | Structured version Visualization version GIF version | ||
| Description: axextb 2740 with distinctors instead of distinct variable conditions. (Contributed by Scott Fenton, 13-Dec-2010.) |
| Ref | Expression |
|---|---|
| axextbdist | ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑥 = 𝑦 ↔ ∀𝑧(𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axc9 2416 | . . . 4 ⊢ (¬ ∀𝑧 𝑧 = 𝑥 → (¬ ∀𝑧 𝑧 = 𝑦 → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))) | |
| 2 | 1 | imp 411 | . . 3 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)) |
| 3 | nfnae 2468 | . . . . 5 ⊢ Ⅎ𝑧 ¬ ∀𝑧 𝑧 = 𝑥 | |
| 4 | nfnae 2468 | . . . . 5 ⊢ Ⅎ𝑧 ¬ ∀𝑧 𝑧 = 𝑦 | |
| 5 | 3, 4 | nfan 1922 | . . . 4 ⊢ Ⅎ𝑧(¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) |
| 6 | elequ2 2160 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦)) | |
| 7 | 6 | a1i 11 | . . . 4 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑥 = 𝑦 → (𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦))) |
| 8 | 5, 7 | alimd 2250 | . . 3 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (∀𝑧 𝑥 = 𝑦 → ∀𝑧(𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦))) |
| 9 | 2, 8 | syld 48 | . 2 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑥 = 𝑦 → ∀𝑧(𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦))) |
| 10 | axextdist 36160 | . 2 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (∀𝑧(𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦) → 𝑥 = 𝑦)) | |
| 11 | 9, 10 | impbid 215 | 1 ⊢ ((¬ ∀𝑧 𝑧 = 𝑥 ∧ ¬ ∀𝑧 𝑧 = 𝑦) → (𝑥 = 𝑦 ↔ ∀𝑧(𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∀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-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-13 2406 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1566 df-ex 1803 df-nf 1807 df-clel 2840 df-nfc 2914 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |