HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem dfun3 1671
Description: Union defined in terms of intersection (DeMorgan's law). Definition of union in [Mendelson] p. 231.
Assertion
Ref Expression
dfun3 |- (A u. B) = (V \ ((V \ A) i^i (V \ B)))

Proof of Theorem dfun3
StepHypRef Expression
1 dfun2 1668 . 2 |- (A u. B) = (V \ ((V \ A) \ B))
2 dfin2 1669 . . . 4 |- ((V \ A) i^i (V \ B)) = ((V \ A) \ (V \ (V \ B)))
3 ddif 1597 . . . . 5 |- (V \ (V \ B)) = B
43difeq2i 1585 . . . 4 |- ((V \ A) \ (V \ (V \ B))) = ((V \ A) \ B)
52, 4eqtr2 1120 . . 3 |- ((V \ A) \ B) = ((V \ A) i^i (V \ B))
65difeq2i 1585 . 2 |- (V \ ((V \ A) \ B)) = (V \ ((V \ A) i^i (V \ B)))
71, 6eqtr 1119 1 |- (A u. B) = (V \ ((V \ A) i^i (V \ B)))
Colors of variables: wff set class
Syntax hints:   = wceq 1091  Vcvv 1348   \ cdif 1484   u. cun 1485   i^i cin 1486
This theorem is referenced by:  difundi 1681  undifv 1760
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
metamath.org