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

Theorem iundif2ss 3938
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 3130 . . . . . 6  |-  ( y  e.  ( B  \  C )  <->  ( y  e.  B  /\  -.  y  e.  C ) )
21rexbii 2477 . . . . 5  |-  ( E. x  e.  A  y  e.  ( B  \  C )  <->  E. x  e.  A  ( y  e.  B  /\  -.  y  e.  C ) )
3 r19.42v 2627 . . . . 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 2459 . . . . . 6  |-  ( E. x  e.  A  -.  y  e.  C  ->  -. 
A. x  e.  A  y  e.  C )
6 vex 2733 . . . . . . 7  |-  y  e. 
_V
7 eliin 3878 . . . . . . 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 672 . . . . 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 3877 . . 3  |-  ( y  e.  U_ x  e.  A  ( B  \  C )  <->  E. x  e.  A  y  e.  ( B  \  C ) )
13 eldif 3130 . . 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 3151 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 2141   A.wral 2448   E.wrex 2449   _Vcvv 2730    \ cdif 3118    C_ wss 3121   U_ciun 3873   |^|_ciin 3874
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-in 3127  df-ss 3134  df-iun 3875  df-iin 3876
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator