MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  erlecpbl Structured version   Unicode version

Theorem erlecpbl 13776
Description: Translate the relation compatiblity relation to a quotient set. (Contributed by Mario Carneiro, 24-Feb-2015.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypotheses
Ref Expression
ercpbl.r  |-  ( ph  ->  .~  Er  V )
ercpbl.v  |-  ( ph  ->  V  e.  _V )
ercpbl.f  |-  F  =  ( x  e.  V  |->  [ x ]  .~  )
erlecpbl.e  |-  ( ph  ->  ( ( A  .~  C  /\  B  .~  D
)  ->  ( A N B  <->  C N D ) ) )
Assertion
Ref Expression
erlecpbl  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( (
( F `  A
)  =  ( F `
 C )  /\  ( F `  B )  =  ( F `  D ) )  -> 
( A N B  <-> 
C N D ) ) )
Distinct variable groups:    x,  .~    x, A    x, B    x, C    x, D    x, V    ph, x
Allowed substitution hints:    F( x)    N( x)

Proof of Theorem erlecpbl
StepHypRef Expression
1 ercpbl.r . . . . 5  |-  ( ph  ->  .~  Er  V )
213ad2ant1 979 . . . 4  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  .~  Er  V
)
3 ercpbl.v . . . . 5  |-  ( ph  ->  V  e.  _V )
433ad2ant1 979 . . . 4  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  V  e.  _V )
5 ercpbl.f . . . 4  |-  F  =  ( x  e.  V  |->  [ x ]  .~  )
6 simp2l 984 . . . 4  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  A  e.  V )
72, 4, 5, 6ercpbllem 13774 . . 3  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( ( F `  A )  =  ( F `  C )  <->  A  .~  C ) )
8 simp2r 985 . . . 4  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  B  e.  V )
92, 4, 5, 8ercpbllem 13774 . . 3  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( ( F `  B )  =  ( F `  D )  <->  B  .~  D ) )
107, 9anbi12d 693 . 2  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( (
( F `  A
)  =  ( F `
 C )  /\  ( F `  B )  =  ( F `  D ) )  <->  ( A  .~  C  /\  B  .~  D ) ) )
11 erlecpbl.e . . 3  |-  ( ph  ->  ( ( A  .~  C  /\  B  .~  D
)  ->  ( A N B  <->  C N D ) ) )
12113ad2ant1 979 . 2  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( ( A  .~  C  /\  B  .~  D )  ->  ( A N B  <->  C N D ) ) )
1310, 12sylbid 208 1  |-  ( (
ph  /\  ( A  e.  V  /\  B  e.  V )  /\  ( C  e.  V  /\  D  e.  V )
)  ->  ( (
( F `  A
)  =  ( F `
 C )  /\  ( F `  B )  =  ( F `  D ) )  -> 
( A N B  <-> 
C N D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 178    /\ wa 360    /\ w3a 937    = wceq 1653    e. wcel 1726   _Vcvv 2957   class class class wbr 4213    e. cmpt 4267   ` cfv 5455    Er wer 6903   [cec 6904
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2418  ax-sep 4331  ax-nul 4339  ax-pow 4378  ax-pr 4404
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2286  df-mo 2287  df-clab 2424  df-cleq 2430  df-clel 2433  df-nfc 2562  df-ne 2602  df-ral 2711  df-rex 2712  df-rab 2715  df-v 2959  df-sbc 3163  df-dif 3324  df-un 3326  df-in 3328  df-ss 3335  df-nul 3630  df-if 3741  df-sn 3821  df-pr 3822  df-op 3824  df-uni 4017  df-br 4214  df-opab 4268  df-mpt 4269  df-id 4499  df-xp 4885  df-rel 4886  df-cnv 4887  df-co 4888  df-dm 4889  df-rn 4890  df-res 4891  df-ima 4892  df-iota 5419  df-fun 5457  df-fv 5463  df-er 6906  df-ec 6908
  Copyright terms: Public domain W3C validator