Theorem uneqin 4257

Description: Equality of union and intersection implies equality of their arguments. (Contributed by NM, 16-Apr-2006.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
uneqin	⊢ ((𝐴 ∪ 𝐵) = (𝐴 ∩ 𝐵) ↔ 𝐴 = 𝐵)

Proof of Theorem uneqin

Step	Hyp	Ref	Expression
1		eqimss 4025	. . . 4 ⊢ ((𝐴 ∪ 𝐵) = (𝐴 ∩ 𝐵) → (𝐴 ∪ 𝐵) ⊆ (𝐴 ∩ 𝐵))
2		unss 4162	. . . . 5 ⊢ ((𝐴 ⊆ (𝐴 ∩ 𝐵) ∧ 𝐵 ⊆ (𝐴 ∩ 𝐵)) ↔ (𝐴 ∪ 𝐵) ⊆ (𝐴 ∩ 𝐵))
3		ssin 4209	. . . . . . 7 ⊢ ((𝐴 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐵) ↔ 𝐴 ⊆ (𝐴 ∩ 𝐵))
4		sstr 3977	. . . . . . 7 ⊢ ((𝐴 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝐵) → 𝐴 ⊆ 𝐵)
5	3, 4	sylbir 237	. . . . . 6 ⊢ (𝐴 ⊆ (𝐴 ∩ 𝐵) → 𝐴 ⊆ 𝐵)
6		ssin 4209	. . . . . . 7 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝐵) ↔ 𝐵 ⊆ (𝐴 ∩ 𝐵))
7		simpl 485	. . . . . . 7 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝐵) → 𝐵 ⊆ 𝐴)
8	6, 7	sylbir 237	. . . . . 6 ⊢ (𝐵 ⊆ (𝐴 ∩ 𝐵) → 𝐵 ⊆ 𝐴)
9	5, 8	anim12i 614	. . . . 5 ⊢ ((𝐴 ⊆ (𝐴 ∩ 𝐵) ∧ 𝐵 ⊆ (𝐴 ∩ 𝐵)) → (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))
10	2, 9	sylbir 237	. . . 4 ⊢ ((𝐴 ∪ 𝐵) ⊆ (𝐴 ∩ 𝐵) → (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))
11	1, 10	syl 17	. . 3 ⊢ ((𝐴 ∪ 𝐵) = (𝐴 ∩ 𝐵) → (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))
12		eqss 3984	. . 3 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))
13	11, 12	sylibr 236	. 2 ⊢ ((𝐴 ∪ 𝐵) = (𝐴 ∩ 𝐵) → 𝐴 = 𝐵)
14		unidm 4130	. . . 4 ⊢ (𝐴 ∪ 𝐴) = 𝐴
15		inidm 4197	. . . 4 ⊢ (𝐴 ∩ 𝐴) = 𝐴
16	14, 15	eqtr4i 2849	. . 3 ⊢ (𝐴 ∪ 𝐴) = (𝐴 ∩ 𝐴)
17		uneq2 4135	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∪ 𝐴) = (𝐴 ∪ 𝐵))
18		ineq2 4185	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ 𝐴) = (𝐴 ∩ 𝐵))
19	16, 17, 18	3eqtr3a 2882	. 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∪ 𝐵) = (𝐴 ∩ 𝐵))
20	13, 19	impbii 211	1 ⊢ ((𝐴 ∪ 𝐵) = (𝐴 ∩ 𝐵) ↔ 𝐴 = 𝐵)

Syntax hints:   ↔ wb 208   ∧ wa 398   = wceq 1537   ∪ cun 3936   ∩ cin 3937   ⊆ wss 3938

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-rab 3149  df-v 3498  df-un 3943  df-in 3945  df-ss 3954

This theorem is referenced by:  uniintsn  4915