Theorem ineqcom 4163

Description: Two ways of expressing that two classes have a given intersection. This is often used when that given intersection is the empty set, in which case the statement displays two ways of expressing that two classes are disjoint (when 𝐶 = ∅: ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅)). (Contributed by Peter Mazsa, 22-Mar-2017.)

Assertion

Ref	Expression
ineqcom	⊢ ((𝐴 ∩ 𝐵) = 𝐶 ↔ (𝐵 ∩ 𝐴) = 𝐶)

Proof of Theorem ineqcom

Step	Hyp	Ref	Expression
1		incom 4162	. 2 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
2	1	eqeq1i 2768	1 ⊢ ((𝐴 ∩ 𝐵) = 𝐶 ↔ (𝐵 ∩ 𝐴) = 𝐶)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∩ cin 3904

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-9 2153  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-rab 3417  df-in 3912

This theorem is used by:  sseqin2  4176  disjr  4411  uneqdifeq  4453  fnunres2  6648  padct  33072