Theorem eliminable-abelv 36346

Description: A theorem used to prove the base case of the Eliminability Theorem (see section comment): abstraction belongs to variable. (Contributed by BJ, 30-Apr-2024.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
eliminable-abelv	⊢ ({𝑥 ∣ 𝜑} ∈ 𝑦 ↔ ∃𝑧(∀𝑡(𝑡 ∈ 𝑧 ↔ [𝑡 / 𝑥]𝜑) ∧ 𝑧 ∈ 𝑦))

Distinct variable groups:   𝑥,𝑡,𝑧   𝑦,𝑧   𝜑,𝑧,𝑡

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem eliminable-abelv

Step	Hyp	Ref	Expression
1		dfclel 2807	. 2 ⊢ ({𝑥 ∣ 𝜑} ∈ 𝑦 ↔ ∃𝑧(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 ∈ 𝑦))
2		eliminable-veqab 36343	. . . 4 ⊢ (𝑧 = {𝑥 ∣ 𝜑} ↔ ∀𝑡(𝑡 ∈ 𝑧 ↔ [𝑡 / 𝑥]𝜑))
3	2	anbi1i 623	. . 3 ⊢ ((𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 ∈ 𝑦) ↔ (∀𝑡(𝑡 ∈ 𝑧 ↔ [𝑡 / 𝑥]𝜑) ∧ 𝑧 ∈ 𝑦))
4	3	exbii 1843	. 2 ⊢ (∃𝑧(𝑧 = {𝑥 ∣ 𝜑} ∧ 𝑧 ∈ 𝑦) ↔ ∃𝑧(∀𝑡(𝑡 ∈ 𝑧 ↔ [𝑡 / 𝑥]𝜑) ∧ 𝑧 ∈ 𝑦))
5	1, 4	bitri 275	1 ⊢ ({𝑥 ∣ 𝜑} ∈ 𝑦 ↔ ∃𝑧(∀𝑡(𝑡 ∈ 𝑧 ↔ [𝑡 / 𝑥]𝜑) ∧ 𝑧 ∈ 𝑦))

Syntax hints:   ↔ wb 205   ∧ wa 395  ∀wal 1532   = wceq 1534  ∃wex 1774  [wsb 2060   ∈ wcel 2099  {cab 2705

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1775  df-clab 2706  df-cleq 2720  df-clel 2806

This theorem is referenced by: (None)

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »