Theorem inteq 3936

Description: Equality law for intersection. (Contributed by NM, 13-Sep-1999.)

Assertion

Ref	Expression
inteq	|- ( A = B -> |^| A = |^| B )

Proof of Theorem inteq

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		raleq 2731	. . 3 |- ( A = B -> ( A. y e. A x e. y <-> A. y e. B x e. y ) )
2	1	abbidv 2350	. 2 |- ( A = B -> { x | A. y e. A x e. y } = { x | A. y e. B x e. y } )
3		dfint2 3935	. 2 |- |^| A = { x | A. y e. A x e. y }
4		dfint2 3935	. 2 |- |^| B = { x | A. y e. B x e. y }
5	2, 3, 4	3eqtr4g 2289	1 |- ( A = B -> |^| A = |^| B )

Syntax hints:   -> wi 4   = wceq 1398   {cab 2217   A.wral 2511   |^|cint 3933

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-int 3934

This theorem is referenced by:  inteqi  3937  inteqd  3938  uniintsnr  3969  rint0  3972  intexr  4245  onintexmid  4677  elreldm  4964  elxp5  5232  1stval2  6327  fundmen  7024  xpsnen  7048  fiintim  7166  elfir  7215  fiinopn  14798  bj-intexr  16607