Theorem ssundif 1764

Description: Union of complementary parts into whole.

Assertion

Ref	Expression
ssundif	|- (A (_ B <-> (A u. (B \ A)) = B)

Proof of Theorem ssundif

Step	Hyp	Ref	Expression
1		ssequn1 1628	. 2 |- (A (_ B <-> (A u. B) = B)
2		undif2 1762	. . 3 |- (A u. (B \ A)) = (A u. B)
3	2	cleq1i 1108	. 2 |- ((A u. (B \ A)) = B <-> (A u. B) = B)
4	1, 3	bitr4 154	1 |- (A (_ B <-> (A u. (B \ A)) = B)

Syntax hints:   <-> wb 127   = wceq 1091   \ cdif 1484   u. cun 1485   (_ wss 1487

This theorem is referenced by:  dfdom2 3288  sbthlem5 3353  sbthlem6 3354  mapdom2 3389  limensuci 3401  phplem1 3403  pssnn 3428  unfi 3441  fodomb 3615

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708

metamath.org