Theorem resindir 4985

Description: Class restriction distributes over intersection. (Contributed by set.mm contributors, 18-Dec-2008.)

Assertion

Ref	Expression
resindir	|- ((A i^i B) |` C) = ((A |` C) i^i (B |` C))

Proof of Theorem resindir

Step	Hyp	Ref	Expression
1		inindir 3474	. 2 |- ((A i^i B) i^i (C X. _V)) = ((A i^i (C X. _V)) i^i (B i^i (C X. _V)))
2		df-res 4789	. 2 |- ((A i^i B) |` C) = ((A i^i B) i^i (C X. _V))
3		df-res 4789	. . 3 |- (A |` C) = (A i^i (C X. _V))
4		df-res 4789	. . 3 |- (B |` C) = (B i^i (C X. _V))
5	3, 4	ineq12i 3456	. 2 |- ((A |` C) i^i (B |` C)) = ((A i^i (C X. _V)) i^i (B i^i (C X. _V)))
6	1, 2, 5	3eqtr4i 2383	1 |- ((A i^i B) |` C) = ((A |` C) i^i (B |` C))

Syntax hints:   = wceq 1642  _Vcvv 2860   i^i cin 3209   X. cxp 4771   |` cres 4775

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-res 4789

This theorem is referenced by: (None)