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

Theorem riinerm 6882
Description: The relative intersection of a family of equivalence relations is an equivalence relation. (Contributed by Mario Carneiro, 27-Sep-2015.)
Assertion
Ref Expression
riinerm  |-  ( ( E. y  y  e.  A  /\  A. x  e.  A  R  Er  B )  ->  (
( B  X.  B
)  i^i  |^|_ x  e.  A  R )  Er  B )
Distinct variable groups:    x, A    x, B    y, A
Allowed substitution hints:    B( y)    R( x,  y)

Proof of Theorem riinerm
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 iinerm 6881 . 2  |-  ( ( E. y  y  e.  A  /\  A. x  e.  A  R  Er  B )  ->  |^|_ x  e.  A  R  Er  B )
2 eleq1 2301 . . . . . 6  |-  ( x  =  a  ->  (
x  e.  A  <->  a  e.  A ) )
32cbvexv 1974 . . . . 5  |-  ( E. x  x  e.  A  <->  E. a  a  e.  A
)
4 eleq1 2301 . . . . . 6  |-  ( a  =  y  ->  (
a  e.  A  <->  y  e.  A ) )
54cbvexv 1974 . . . . 5  |-  ( E. a  a  e.  A  <->  E. y  y  e.  A
)
63, 5bitri 184 . . . 4  |-  ( E. x  x  e.  A  <->  E. y  y  e.  A
)
7 erssxp 6830 . . . . . . 7  |-  ( R  Er  B  ->  R  C_  ( B  X.  B
) )
87ralimi 2613 . . . . . 6  |-  ( A. x  e.  A  R  Er  B  ->  A. x  e.  A  R  C_  ( B  X.  B ) )
9 riinm 4085 . . . . . 6  |-  ( ( A. x  e.  A  R  C_  ( B  X.  B )  /\  E. x  x  e.  A
)  ->  ( ( B  X.  B )  i^i  |^|_ x  e.  A  R
)  =  |^|_ x  e.  A  R )
108, 9sylan 283 . . . . 5  |-  ( ( A. x  e.  A  R  Er  B  /\  E. x  x  e.  A
)  ->  ( ( B  X.  B )  i^i  |^|_ x  e.  A  R
)  =  |^|_ x  e.  A  R )
11 ereq1 6814 . . . . 5  |-  ( ( ( B  X.  B
)  i^i  |^|_ x  e.  A  R )  = 
|^|_ x  e.  A  R  ->  ( ( ( B  X.  B )  i^i  |^|_ x  e.  A  R )  Er  B  <->  |^|_
x  e.  A  R  Er  B ) )
1210, 11syl 14 . . . 4  |-  ( ( A. x  e.  A  R  Er  B  /\  E. x  x  e.  A
)  ->  ( (
( B  X.  B
)  i^i  |^|_ x  e.  A  R )  Er  B  <->  |^|_ x  e.  A  R  Er  B )
)
136, 12sylan2br 288 . . 3  |-  ( ( A. x  e.  A  R  Er  B  /\  E. y  y  e.  A
)  ->  ( (
( B  X.  B
)  i^i  |^|_ x  e.  A  R )  Er  B  <->  |^|_ x  e.  A  R  Er  B )
)
1413ancoms 268 . 2  |-  ( ( E. y  y  e.  A  /\  A. x  e.  A  R  Er  B )  ->  (
( ( B  X.  B )  i^i  |^|_ x  e.  A  R )  Er  B  <->  |^|_ x  e.  A  R  Er  B
) )
151, 14mpbird 167 1  |-  ( ( E. y  y  e.  A  /\  A. x  e.  A  R  Er  B )  ->  (
( B  X.  B
)  i^i  |^|_ x  e.  A  R )  Er  B )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402   E.wex 1545    e. wcel 2209   A.wral 2528    i^i cin 3219    C_ wss 3220   |^|_ciin 4013    X. cxp 4772    Er wer 6804
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-iin 4015  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-er 6807
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator