Theorem expandrexn 45369

Description: Expand a restricted existential quantifier to primitives while contracting a double negation. (Contributed by Rohan Ridenour, 13-Aug-2023.)

Hypothesis

Ref	Expression
expandrexn.1	⊢ (𝜑 ↔ ¬ 𝜓)

Assertion

Ref	Expression
expandrexn	⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ¬ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓))

Proof of Theorem expandrexn

Step	Hyp	Ref	Expression
1		expandrexn.1	. . 3 ⊢ (𝜑 ↔ ¬ 𝜓)
2	1	rexbii 3109	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐴 ¬ 𝜓)
3		df-rex 3087	. 2 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝜓))
4		exanali 1891	. 2 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓))
5	2, 3, 4	3bitri 300	1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ¬ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-rex 3087

This theorem is used by:  expandrex  45370  ismnuprim  45372