Theorem abv 3443

Description: The class of sets verifying a property is the universal class if and only if that property is a tautology. The reverse implication (bj-abv 37259) requires fewer axioms. (Contributed by BJ, 19-Mar-2021.) Avoid df-clel 2814, ax-8 2121. (Revised by GG, 30-Aug-2024.) (Proof shortened by BJ, 30-Aug-2024.)

Assertion

Ref	Expression
abv	⊢ ({𝑥 ∣ 𝜑} = V ↔ ∀𝑥𝜑)

Proof of Theorem abv

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfcleq 2732	. . 3 ⊢ ({𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤} ↔ ∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ ⊤}))
2		vextru 2724	. . . . . 6 ⊢ 𝑦 ∈ {𝑥 ∣ ⊤}
3	2	tbt 370	. . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ ⊤}))
4		df-clab 2718	. . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑)
5	3, 4	bitr3i 278	. . . 4 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ ⊤}) ↔ [𝑦 / 𝑥]𝜑)
6	5	albii 1826	. . 3 ⊢ (∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ ⊤}) ↔ ∀𝑦[𝑦 / 𝑥]𝜑)
7	1, 6	bitri 276	. 2 ⊢ ({𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤} ↔ ∀𝑦[𝑦 / 𝑥]𝜑)
8		dfv2 3434	. . 3 ⊢ V = {𝑥 ∣ ⊤}
9	8	eqeq2i 2752	. 2 ⊢ ({𝑥 ∣ 𝜑} = V ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤})
10		sb8v 2361	. 2 ⊢ (∀𝑥𝜑 ↔ ∀𝑦[𝑦 / 𝑥]𝜑)
11	7, 9, 10	3bitr4i 304	1 ⊢ ({𝑥 ∣ 𝜑} = V ↔ ∀𝑥𝜑)

Syntax hints:   ↔ wb 207  ∀wal 1545   = wceq 1547  ⊤wtru 1548  [wsb 2073   ∈ wcel 2119  {cab 2717  Vcvv 3431

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-9 2129  ax-11 2168  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-v 3433

This theorem is referenced by:  dfnf5  4310  mh-setind  36764  ecqmap  38816