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

Theorem intunsn 1993
Description: Theorem joining a singleton to an intersection.
Hypothesis
Ref Expression
intunsn.1 |- B e. V
Assertion
Ref Expression
intunsn |- |^|(A u. {B}) = (|^|A i^i B)

Proof of Theorem intunsn
StepHypRef Expression
1 intun 1989 . 2 |- |^|(A u. {B}) = (|^|A i^i |^|{B})
2 intunsn.1 . . . 4 |- B e. V
32intsn 1991 . . 3 |- |^|{B} = B
43ineq2i 1642 . 2 |- (|^|A i^i |^|{B}) = (|^|A i^i B)
51, 4eqtr 1119 1 |- |^|(A u. {B}) = (|^|A i^i B)
Colors of variables: wff set class
Syntax hints:   = wceq 1091   e. wcel 1092  Vcvv 1348   u. cun 1485   i^i cin 1486  {csn 1808  |^|cint 1965
This theorem is referenced by:  fiint 3445
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-ral 1205  df-v 1349  df-un 1490  df-in 1491  df-sn 1811  df-pr 1812  df-int 1966
metamath.org