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

Theorem reliin 4849
Description: An indexed intersection is a relation if at least one of the member of the indexed family is a relation. (Contributed by NM, 8-Mar-2014.)
Assertion
Ref Expression
reliin  |-  ( E. x  e.  A  Rel  B  ->  Rel  |^|_ x  e.  A  B )

Proof of Theorem reliin
StepHypRef Expression
1 iinss 4022 . 2  |-  ( E. x  e.  A  B  C_  ( _V  X.  _V )  ->  |^|_ x  e.  A  B  C_  ( _V  X.  _V ) )
2 df-rel 4732 . . 3  |-  ( Rel 
B  <->  B  C_  ( _V 
X.  _V ) )
32rexbii 2539 . 2  |-  ( E. x  e.  A  Rel  B  <->  E. x  e.  A  B  C_  ( _V  X.  _V ) )
4 df-rel 4732 . 2  |-  ( Rel  |^|_ x  e.  A  B  <->  |^|_
x  e.  A  B  C_  ( _V  X.  _V ) )
51, 3, 43imtr4i 201 1  |-  ( E. x  e.  A  Rel  B  ->  Rel  |^|_ x  e.  A  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4   E.wrex 2511   _Vcvv 2802    C_ wss 3200   |^|_ciin 3971    X. cxp 4723   Rel wrel 4730
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-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-in 3206  df-ss 3213  df-iin 3973  df-rel 4732
This theorem is referenced by:  relint  4851  xpiindim  4867
  Copyright terms: Public domain W3C validator