Theorem bnj1019 32055

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Assertion

Ref	Expression
bnj1019	⊢ (∃𝑝(𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ↔ (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏))

Distinct variable groups:   𝜒,𝑝   𝜂,𝑝   𝜃,𝑝

Allowed substitution hint:   𝜏(𝑝)

Proof of Theorem bnj1019

Step	Hyp	Ref	Expression
1		19.42v 1953	. 2 ⊢ (∃𝑝((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ 𝜏) ↔ ((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ ∃𝑝𝜏))
2		bnj258 31982	. . 3 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ↔ ((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ 𝜏))
3	2	exbii 1847	. 2 ⊢ (∃𝑝(𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ↔ ∃𝑝((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ 𝜏))
4		df-bnj17 31961	. 2 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏) ↔ ((𝜃 ∧ 𝜒 ∧ 𝜂) ∧ ∃𝑝𝜏))
5	1, 3, 4	3bitr4i 305	1 ⊢ (∃𝑝(𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) ↔ (𝜃 ∧ 𝜒 ∧ 𝜂 ∧ ∃𝑝𝜏))

Syntax hints:   ↔ wb 208   ∧ wa 398   ∧ w3a 1083  ∃wex 1779   ∧ w-bnj17 31960

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910

This theorem depends on definitions:  df-bi 209  df-an 399  df-3an 1085  df-ex 1780  df-bnj17 31961

This theorem is referenced by:  bnj1018g  32239  bnj1018  32240  bnj1020  32241  bnj1021  32242