Theorem bj-rabtrAUTO 32929

Description: Proof of bj-rabtr 32926 found automatically by "improve all /depth 3 /3" followed by "minimize *". (Contributed by BJ, 22-Apr-2019.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
bj-rabtrAUTO	|- { x e. A | T. } = A

Distinct variable group:   x, A

Proof of Theorem bj-rabtrAUTO

Step	Hyp	Ref	Expression
1		ssrab2 3687	. 2 |- { x e. A | T. } C_ A
2		ssid 3624	. . . . 5 |- A C_ A
3	2	a1i 11	. . . 4 |- ( T. -> A C_ A )
4		simpl 473	. . . 4 |- ( ( T. /\ x e. A ) -> T. )
5	3, 4	ssrabdv 3681	. . 3 |- ( T. -> A C_ { x e. A | T. } )
6	5	trud 1493	. 2 |- A C_ { x e. A | T. }
7	1, 6	eqssi 3619	1 |- { x e. A | T. } = A

Syntax hints:   = wceq 1483   T. wtru 1484   e. wcel 1990   {crab 2916   C_ wss 3574

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rab 2921  df-in 3581  df-ss 3588

This theorem is referenced by: (None)