Theorem bj-rabtrAUTO 35099

Description: Proof of bj-rabtr 35097 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 4017	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ ⊤} ⊆ 𝐴
2		ssid 3947	. . . . 5 ⊢ 𝐴 ⊆ 𝐴
3	2	a1i 11	. . . 4 ⊢ (⊤ → 𝐴 ⊆ 𝐴)
4		simpl 482	. . . 4 ⊢ ((⊤ ∧ 𝑥 ∈ 𝐴) → ⊤)
5	3, 4	ssrabdv 4011	. . 3 ⊢ (⊤ → 𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ ⊤})
6	5	mptru 1548	. 2 ⊢ 𝐴 ⊆ {𝑥 ∈ 𝐴 ∣ ⊤}
7	1, 6	eqssi 3941	1 ⊢ {𝑥 ∈ 𝐴 ∣ ⊤} = 𝐴

Syntax hints:   = wceq 1541  ⊤wtru 1542   ∈ wcel 2109  {crab 3069   ⊆ wss 3891

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1544  df-ex 1786  df-nf 1790  df-sb 2071  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ral 3070  df-rab 3074  df-v 3432  df-in 3898  df-ss 3908

This theorem is referenced by: (None)