ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iundif2ss Unicode version

Theorem iundif2ss 3931
Description: Indexed union of class difference. Compare to theorem "De Morgan's laws" in [Enderton] p. 31. (Contributed by Jim Kingdon, 17-Aug-2018.)
Assertion
Ref Expression
iundif2ss  |-  U_ x  e.  A  ( B  \  C )  C_  ( B  \  |^|_ x  e.  A  C )
Distinct variable group:    x, B
Allowed substitution hints:    A( x)    C( x)

Proof of Theorem iundif2ss
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eldif 3125 . . . . . 6  |-  ( y  e.  ( B  \  C )  <->  ( y  e.  B  /\  -.  y  e.  C ) )
21rexbii 2473 . . . . 5  |-  ( E. x  e.  A  y  e.  ( B  \  C )  <->  E. x  e.  A  ( y  e.  B  /\  -.  y  e.  C ) )
3 r19.42v 2623 . . . . 5  |-  ( E. x  e.  A  ( y  e.  B  /\  -.  y  e.  C
)  <->  ( y  e.  B  /\  E. x  e.  A  -.  y  e.  C ) )
42, 3bitri 183 . . . 4  |-  ( E. x  e.  A  y  e.  ( B  \  C )  <->  ( y  e.  B  /\  E. x  e.  A  -.  y  e.  C ) )
5 rexnalim 2455 . . . . . 6  |-  ( E. x  e.  A  -.  y  e.  C  ->  -. 
A. x  e.  A  y  e.  C )
6 vex 2729 . . . . . . 7  |-  y  e. 
_V
7 eliin 3871 . . . . . . 7  |-  ( y  e.  _V  ->  (
y  e.  |^|_ x  e.  A  C  <->  A. x  e.  A  y  e.  C ) )
86, 7ax-mp 5 . . . . . 6  |-  ( y  e.  |^|_ x  e.  A  C 
<-> 
A. x  e.  A  y  e.  C )
95, 8sylnibr 667 . . . . 5  |-  ( E. x  e.  A  -.  y  e.  C  ->  -.  y  e.  |^|_ x  e.  A  C )
109anim2i 340 . . . 4  |-  ( ( y  e.  B  /\  E. x  e.  A  -.  y  e.  C )  ->  ( y  e.  B  /\  -.  y  e.  |^|_ x  e.  A  C ) )
114, 10sylbi 120 . . 3  |-  ( E. x  e.  A  y  e.  ( B  \  C )  ->  (
y  e.  B  /\  -.  y  e.  |^|_ x  e.  A  C )
)
12 eliun 3870 . . 3  |-  ( y  e.  U_ x  e.  A  ( B  \  C )  <->  E. x  e.  A  y  e.  ( B  \  C ) )
13 eldif 3125 . . 3  |-  ( y  e.  ( B  \  |^|_ x  e.  A  C
)  <->  ( y  e.  B  /\  -.  y  e.  |^|_ x  e.  A  C ) )
1411, 12, 133imtr4i 200 . 2  |-  ( y  e.  U_ x  e.  A  ( B  \  C )  ->  y  e.  ( B  \  |^|_ x  e.  A  C ) )
1514ssriv 3146 1  |-  U_ x  e.  A  ( B  \  C )  C_  ( B  \  |^|_ x  e.  A  C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 103    <-> wb 104    e. wcel 2136   A.wral 2444   E.wrex 2445   _Vcvv 2726    \ cdif 3113    C_ wss 3116   U_ciun 3866   |^|_ciin 3867
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-dif 3118  df-in 3122  df-ss 3129  df-iun 3868  df-iin 3869
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator