Theorem inex2 1698

Description: Separation Scheme (Aussonderung) using class notation.

Hypothesis

Ref	Expression
inex2.1	|- A e. V

Assertion

Ref	Expression
inex2	|- (B i^i A) e. V

Proof of Theorem inex2

Step	Hyp	Ref	Expression
1		incom 1636	. 2 |- (B i^i A) = (A i^i B)
2		inex2.1	. . 3 |- A e. V
3	2	inex1 1697	. 2 |- (A i^i B) e. V
4	1, 3	eqeltr 1159	1 |- (B i^i A) e. V

Syntax hints:   e. wcel 1092  Vcvv 1348   i^i cin 1486

This theorem is referenced by:  ssex 1700  wefrc 2195  aceq5lem5 3562  weth 3602

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075

This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-in 1491

metamath.org