Theorem bj-rabtrAUTO 36898

Description: Proof of bj-rabtr 36896 found automatically by the Metamath program "MM-PA> IMPROVE ALL / DEPTH 3 / 3" command followed by "MM-PA> MINIMIZE_WITH *". (Contributed by BJ, 22-Apr-2019.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
bj-rabtrAUTO	⊢ {𝑥 ∈ 𝐴 ∣ ⊤} = 𝐴

Distinct variable group:   𝑥,𝐴

Proof of Theorem bj-rabtrAUTO

Step	Hyp	Ref	Expression
1		ssrab2 4103	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ ⊤} ⊆ 𝐴
2		ssid 4031	. . . . 5 ⊢ 𝐴 ⊆ 𝐴
3	2	a1i 11	. . . 4 ⊢ (⊤ → 𝐴 ⊆ 𝐴)
4		simpl 482	. . . 4 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐴) → ⊤)
5	3, 4	ssrabdv 4097	. . 3 ⊢ (⊤ → 𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ ⊤})
6	5	mptru 1544	. 2 ⊢ 𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ ⊤}
7	1, 6	eqssi 4025	1 ⊢ {𝑥 ∈ 𝐴 ∣ ⊤} = 𝐴

Syntax hints:   = wceq 1537  ⊤wtru 1538   ∈ wcel 2108  {crab 3443   ⊆ wss 3976

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-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rab 3444  df-ss 3993

This theorem is referenced by: (None)