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

Theorem iundif2ss 4041
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 3210 . . . . . 6  |-  ( y  e.  ( B  \  C )  <->  ( y  e.  B  /\  -.  y  e.  C ) )
21rexbii 2540 . . . . 5  |-  ( E. x  e.  A  y  e.  ( B  \  C )  <->  E. x  e.  A  ( y  e.  B  /\  -.  y  e.  C ) )
3 r19.42v 2691 . . . . 5  |-  ( E. x  e.  A  ( y  e.  B  /\  -.  y  e.  C
)  <->  ( y  e.  B  /\  E. x  e.  A  -.  y  e.  C ) )
42, 3bitri 184 . . . 4  |-  ( E. x  e.  A  y  e.  ( B  \  C )  <->  ( y  e.  B  /\  E. x  e.  A  -.  y  e.  C ) )
5 rexnalim 2522 . . . . . 6  |-  ( E. x  e.  A  -.  y  e.  C  ->  -. 
A. x  e.  A  y  e.  C )
6 vex 2806 . . . . . . 7  |-  y  e. 
_V
7 eliin 3980 . . . . . . 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 684 . . . . 5  |-  ( E. x  e.  A  -.  y  e.  C  ->  -.  y  e.  |^|_ x  e.  A  C )
109anim2i 342 . . . 4  |-  ( ( y  e.  B  /\  E. x  e.  A  -.  y  e.  C )  ->  ( y  e.  B  /\  -.  y  e.  |^|_ x  e.  A  C ) )
114, 10sylbi 121 . . 3  |-  ( E. x  e.  A  y  e.  ( B  \  C )  ->  (
y  e.  B  /\  -.  y  e.  |^|_ x  e.  A  C )
)
12 eliun 3979 . . 3  |-  ( y  e.  U_ x  e.  A  ( B  \  C )  <->  E. x  e.  A  y  e.  ( B  \  C ) )
13 eldif 3210 . . 3  |-  ( y  e.  ( B  \  |^|_ x  e.  A  C
)  <->  ( y  e.  B  /\  -.  y  e.  |^|_ x  e.  A  C ) )
1411, 12, 133imtr4i 201 . 2  |-  ( y  e.  U_ x  e.  A  ( B  \  C )  ->  y  e.  ( B  \  |^|_ x  e.  A  C ) )
1514ssriv 3232 1  |-  U_ x  e.  A  ( B  \  C )  C_  ( B  \  |^|_ x  e.  A  C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 104    <-> wb 105    e. wcel 2202   A.wral 2511   E.wrex 2512   _Vcvv 2803    \ cdif 3198    C_ wss 3201   U_ciun 3975   |^|_ciin 3976
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-dif 3203  df-in 3207  df-ss 3214  df-iun 3977  df-iin 3978
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator