| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > axextdfeq | Structured version Visualization version GIF version | ||
| Description: A version of ax-ext 2737 for use with defined equality. (Contributed by Scott Fenton, 12-Dec-2010.) |
| Ref | Expression |
|---|---|
| axextdfeq | ⊢ ∃𝑧((𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ((𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑥) → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axextnd 10587 | . . 3 ⊢ ∃𝑧((𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦) → 𝑥 = 𝑦) | |
| 2 | ax8 2152 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤)) | |
| 3 | 2 | imim2i 17 | . . 3 ⊢ (((𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦) → 𝑥 = 𝑦) → ((𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦) → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤))) |
| 4 | 1, 3 | eximii 1870 | . 2 ⊢ ∃𝑧((𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦) → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤)) |
| 5 | biimpexp 36222 | . . 3 ⊢ (((𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦) → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤)) ↔ ((𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ((𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑥) → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤)))) | |
| 6 | 5 | exbii 1881 | . 2 ⊢ (∃𝑧((𝑧 ∈ 𝑥 ↔ 𝑧 ∈ 𝑦) → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤)) ↔ ∃𝑧((𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ((𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑥) → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤)))) |
| 7 | 4, 6 | mpbi 233 | 1 ⊢ ∃𝑧((𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦) → ((𝑧 ∈ 𝑦 → 𝑧 ∈ 𝑥) → (𝑥 ∈ 𝑤 → 𝑦 ∈ 𝑤))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∃wex 1812 |
| 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-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-13 2406 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-clel 2840 df-nfc 2914 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |