Theorem rint0 3805

Description: Relative intersection of an empty set. (Contributed by Stefan O'Rear, 3-Apr-2015.)

Assertion

Ref	Expression
rint0	⊢ (𝑋 = ∅ → (𝐴 ∩ ∩ 𝑋) = 𝐴)

Proof of Theorem rint0

Step	Hyp	Ref	Expression
1		inteq 3769	. . 3 ⊢ (𝑋 = ∅ → ∩ 𝑋 = ∩ ∅)
2	1	ineq2d 3272	. 2 ⊢ (𝑋 = ∅ → (𝐴 ∩ ∩ 𝑋) = (𝐴 ∩ ∩ ∅))
3		int0 3780	. . . 4 ⊢ ∩ ∅ = V
4	3	ineq2i 3269	. . 3 ⊢ (𝐴 ∩ ∩ ∅) = (𝐴 ∩ V)
5		inv1 3394	. . 3 ⊢ (𝐴 ∩ V) = 𝐴
6	4, 5	eqtri 2158	. 2 ⊢ (𝐴 ∩ ∩ ∅) = 𝐴
7	2, 6	syl6eq 2186	1 ⊢ (𝑋 = ∅ → (𝐴 ∩ ∩ 𝑋) = 𝐴)

Syntax hints:   → wi 4   = wceq 1331  Vcvv 2681   ∩ cin 3065  ∅c0 3358  ∩ cint 3766

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-v 2683  df-dif 3068  df-in 3072  df-ss 3079  df-nul 3359  df-int 3767

This theorem is referenced by: (None)