Theorem bj-abv 37996

Description: The class of sets verifying a tautology is the universal class. (Contributed by BJ, 24-Jul-2019.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-abv	⊢ (∀𝑥𝜑 → {𝑥 ∣ 𝜑} = V)

Proof of Theorem bj-abv

Step	Hyp	Ref	Expression
1		trud 1580	. . . . 5 ⊢ ((𝜑 ∧ 𝜑) → ⊤)
2		simpl 488	. . . . 5 ⊢ ((𝜑 ∧ ⊤) → 𝜑)
3	1, 2	impbida 813	. . . 4 ⊢ (𝜑 → (𝜑 ↔ ⊤))
4	3	alimi 1844	. . 3 ⊢ (∀𝑥𝜑 → ∀𝑥(𝜑 ↔ ⊤))
5		abbi 2828	. . 3 ⊢ (∀𝑥(𝜑 ↔ ⊤) → {𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤})
6	4, 5	syl 18	. 2 ⊢ (∀𝑥𝜑 → {𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤})
7		dfv2 3457	. 2 ⊢ V = {𝑥 ∣ ⊤}
8	6, 7	eqtr4di 2816	1 ⊢ (∀𝑥𝜑 → {𝑥 ∣ 𝜑} = V)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ⊤wtru 1571  {cab 2741  Vcvv 3454

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-v 3456

This theorem is used by:  curryset  38037  currysetlem3  38040