Theorem axextprim 36015

Description: ax-ext 2733 without distinct variable conditions or defined symbols. (Contributed by Scott Fenton, 13-Oct-2010.)

Assertion

Ref	Expression
axextprim	⊢ ¬ ∀𝑥 ¬ ((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → ((𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦) → 𝑦 = 𝑧))

Proof of Theorem axextprim

Step	Hyp	Ref	Expression
1		axextnd 10546	. 2 ⊢ ∃𝑥((𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → 𝑦 = 𝑧)
2		dfbi2 478	. . . . . 6 ⊢ ((𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) ↔ ((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) ∧ (𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦)))
3	2	imbi1i 351	. . . . 5 ⊢ (((𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → 𝑦 = 𝑧) ↔ (((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) ∧ (𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦)) → 𝑦 = 𝑧))
4		impexp 454	. . . . 5 ⊢ ((((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) ∧ (𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦)) → 𝑦 = 𝑧) ↔ ((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → ((𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦) → 𝑦 = 𝑧)))
5	3, 4	bitri 277	. . . 4 ⊢ (((𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → 𝑦 = 𝑧) ↔ ((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → ((𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦) → 𝑦 = 𝑧)))
6	5	exbii 1867	. . 3 ⊢ (∃𝑥((𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → 𝑦 = 𝑧) ↔ ∃𝑥((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → ((𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦) → 𝑦 = 𝑧)))
7		df-ex 1799	. . 3 ⊢ (∃𝑥((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → ((𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦) → 𝑦 = 𝑧)) ↔ ¬ ∀𝑥 ¬ ((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → ((𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦) → 𝑦 = 𝑧)))
8	6, 7	bitri 277	. 2 ⊢ (∃𝑥((𝑥 ∈ 𝑦 ↔ 𝑥 ∈ 𝑧) → 𝑦 = 𝑧) ↔ ¬ ∀𝑥 ¬ ((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → ((𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦) → 𝑦 = 𝑧)))
9	1, 8	mpbi 232	1 ⊢ ¬ ∀𝑥 ¬ ((𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧) → ((𝑥 ∈ 𝑧 → 𝑥 ∈ 𝑦) → 𝑦 = 𝑧))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 399  ∀wal 1557  ∃wex 1798

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-13 2402  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1562  df-ex 1799  df-nf 1803  df-clel 2836  df-nfc 2910

This theorem is referenced by: (None)