Theorem 19.9t 2197

Description: Closed form of 19.9 2198 and version of 19.3t 2194 with an existential quantifier. (Contributed by NM, 13-May-1993.) (Revised by Mario Carneiro, 24-Sep-2016.) (Proof shortened by Wolf Lammen, 14-Jul-2020.)

Assertion

Ref	Expression
19.9t	⊢ (Ⅎ𝑥𝜑 → (∃𝑥𝜑 ↔ 𝜑))

Proof of Theorem 19.9t

Step	Hyp	Ref	Expression
1		id 22	. . 3 ⊢ (Ⅎ𝑥𝜑 → Ⅎ𝑥𝜑)
2	1	19.9d 2196	. 2 ⊢ (Ⅎ𝑥𝜑 → (∃𝑥𝜑 → 𝜑))
3		19.8a 2174	. 2 ⊢ (𝜑 → ∃𝑥𝜑)
4	2, 3	impbid1 224	1 ⊢ (Ⅎ𝑥𝜑 → (∃𝑥𝜑 ↔ 𝜑))

Syntax hints:   → wi 4   ↔ wb 205  ∃wex 1782  Ⅎwnf 1786

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-12 2171

This theorem depends on definitions:  df-bi 206  df-ex 1783  df-nf 1787

This theorem is referenced by:  19.9  2198  19.21t  2199  sbft  2262  vtoclegft  3522  bj-cbv3tb  34969  bj-spimtv  34976  bj-equsal1t  35005  bj-19.21t0  35013  19.9dev  40178