Theorem indifbi 32903

Description: Two ways to express equality relative to a class 𝐴. (Contributed by Thierry Arnoux, 23-Jun-2024.)

Assertion

Ref	Expression
indifbi	⊢ ((𝐴 ∩ 𝐵) = (𝐴 ∩ 𝐶) ↔ (𝐴 ∖ 𝐵) = (𝐴 ∖ 𝐶))

Proof of Theorem indifbi

Step	Hyp	Ref	Expression
1		inss1 4192	. . 3 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴
2		inss1 4192	. . 3 ⊢ (𝐴 ∩ 𝐶) ⊆ 𝐴
3		rcompleq 4261	. . 3 ⊢ (((𝐴 ∩ 𝐵) ⊆ 𝐴 ∧ (𝐴 ∩ 𝐶) ⊆ 𝐴) → ((𝐴 ∩ 𝐵) = (𝐴 ∩ 𝐶) ↔ (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ (𝐴 ∩ 𝐶))))
4	1, 2, 3	mp2an 705	. 2 ⊢ ((𝐴 ∩ 𝐵) = (𝐴 ∩ 𝐶) ↔ (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ (𝐴 ∩ 𝐶)))
5		difin 4228	. . 3 ⊢ (𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ 𝐵)
6		difin 4228	. . 3 ⊢ (𝐴 ∖ (𝐴 ∩ 𝐶)) = (𝐴 ∖ 𝐶)
7	5, 6	eqeq12i 2784	. 2 ⊢ ((𝐴 ∖ (𝐴 ∩ 𝐵)) = (𝐴 ∖ (𝐴 ∩ 𝐶)) ↔ (𝐴 ∖ 𝐵) = (𝐴 ∖ 𝐶))
8	4, 7	bitri 278	1 ⊢ ((𝐴 ∩ 𝐵) = (𝐴 ∩ 𝐶) ↔ (𝐴 ∖ 𝐵) = (𝐴 ∖ 𝐶))

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∖ cdif 3905   ∩ cin 3907   ⊆ wss 3908

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-in 3915  df-ss 3925

This theorem is used by:  fressupp  33070