Theorem abv 3500

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 36872) requires fewer axioms. (Contributed by BJ, 19-Mar-2021.) Avoid df-clel 2819, ax-8 2110. (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 2733	. . 3 ⊢ ({𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤} ↔ ∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ ⊤}))
2		vextru 2724	. . . . . 6 ⊢ 𝑦 ∈ {𝑥 ∣ ⊤}
3	2	tbt 369	. . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ ⊤}))
4		df-clab 2718	. . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑)
5	3, 4	bitr3i 277	. . . 4 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ ⊤}) ↔ [𝑦 / 𝑥]𝜑)
6	5	albii 1817	. . 3 ⊢ (∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ ⊤}) ↔ ∀𝑦[𝑦 / 𝑥]𝜑)
7	1, 6	bitri 275	. 2 ⊢ ({𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤} ↔ ∀𝑦[𝑦 / 𝑥]𝜑)
8		dfv2 3491	. . 3 ⊢ V = {𝑥 ∣ ⊤}
9	8	eqeq2i 2753	. 2 ⊢ ({𝑥 ∣ 𝜑} = V ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤})
10		sb8v 2358	. 2 ⊢ (∀𝑥𝜑 ↔ ∀𝑦[𝑦 / 𝑥]𝜑)
11	7, 9, 10	3bitr4i 303	1 ⊢ ({𝑥 ∣ 𝜑} = V ↔ ∀𝑥𝜑)

Syntax hints:   ↔ wb 206  ∀wal 1535   = wceq 1537  ⊤wtru 1538  [wsb 2064   ∈ wcel 2108  {cab 2717  Vcvv 3488

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-9 2118  ax-11 2158  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-v 3490

This theorem is referenced by:  dfnf5  4405