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

Theorem qusaddflemg 13655
Description: The operation of a quotient structure is a function. (Contributed by Mario Carneiro, 24-Feb-2015.)
Hypotheses
Ref Expression
qusaddf.u  |-  ( ph  ->  U  =  ( R 
/.s  .~  ) )
qusaddf.v  |-  ( ph  ->  V  =  ( Base `  R ) )
qusaddf.r  |-  ( ph  ->  .~  Er  V )
qusaddf.z  |-  ( ph  ->  R  e.  Z )
qusaddf.e  |-  ( ph  ->  ( ( a  .~  p  /\  b  .~  q
)  ->  ( a  .x.  b )  .~  (
p  .x.  q )
) )
qusaddf.c  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  -> 
( p  .x.  q
)  e.  V )
qusaddflem.f  |-  F  =  ( x  e.  V  |->  [ x ]  .~  )
qusaddflem.g  |-  ( ph  -> 
.xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
qusaddflemg.x  |-  ( ph  ->  .x.  e.  W )
Assertion
Ref Expression
qusaddflemg  |-  ( ph  -> 
.xb  : ( ( V /.  .~  )  X.  ( V /.  .~  ) ) --> ( V /.  .~  ) )
Distinct variable groups:    a, b, p, q, x,  .~    F, a, b, p, q    ph, a,
b, p, q, x    V, a, b, p, q, x    R, p, q, x    .x. , p, q, x    .xb , a,
b, p, q
Allowed substitution hints:    R( a,  b)    .xb (
x)    .x. ( a,  b)    U( x,  q,  p,  a,  b)    F( x)    W( x,  q,  p,  a,  b)    Z( x,  q,  p,  a,  b)

Proof of Theorem qusaddflemg
StepHypRef Expression
1 qusaddf.u . . 3  |-  ( ph  ->  U  =  ( R 
/.s  .~  ) )
2 qusaddf.v . . 3  |-  ( ph  ->  V  =  ( Base `  R ) )
3 qusaddflem.f . . 3  |-  F  =  ( x  e.  V  |->  [ x ]  .~  )
4 qusaddf.r . . . 4  |-  ( ph  ->  .~  Er  V )
5 basfn 13411 . . . . . 6  |-  Base  Fn  _V
6 qusaddf.z . . . . . . 7  |-  ( ph  ->  R  e.  Z )
76elexd 2835 . . . . . 6  |-  ( ph  ->  R  e.  _V )
8 funfvex 5712 . . . . . . 7  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
98funfni 5483 . . . . . 6  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
105, 7, 9sylancr 418 . . . . 5  |-  ( ph  ->  ( Base `  R
)  e.  _V )
112, 10eqeltrd 2315 . . . 4  |-  ( ph  ->  V  e.  _V )
12 erex 6831 . . . 4  |-  (  .~  Er  V  ->  ( V  e.  _V  ->  .~  e.  _V ) )
134, 11, 12sylc 62 . . 3  |-  ( ph  ->  .~  e.  _V )
141, 2, 3, 13, 6quslem 13645 . 2  |-  ( ph  ->  F : V -onto-> ( V /.  .~  ) )
15 qusaddf.c . . 3  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  -> 
( p  .x.  q
)  e.  V )
16 qusaddf.e . . 3  |-  ( ph  ->  ( ( a  .~  p  /\  b  .~  q
)  ->  ( a  .x.  b )  .~  (
p  .x.  q )
) )
174, 11, 3, 15, 16ercpbl 13652 . 2  |-  ( (
ph  /\  ( a  e.  V  /\  b  e.  V )  /\  (
p  e.  V  /\  q  e.  V )
)  ->  ( (
( F `  a
)  =  ( F `
 p )  /\  ( F `  b )  =  ( F `  q ) )  -> 
( F `  (
a  .x.  b )
)  =  ( F `
 ( p  .x.  q ) ) ) )
18 qusaddflem.g . 2  |-  ( ph  -> 
.xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
19 qusaddflemg.x . 2  |-  ( ph  ->  .x.  e.  W )
2014, 17, 18, 11, 19, 15imasaddflemg 13637 1  |-  ( ph  -> 
.xb  : ( ( V /.  .~  )  X.  ( V /.  .~  ) ) --> ( V /.  .~  ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   {csn 3709   <.cop 3712   U_ciun 4012   class class class wbr 4130    |-> cmpt 4192    X. cxp 4772    Fn wfn 5372   -->wf 5373   ` cfv 5377  (class class class)co 6085    Er wer 6804   [cec 6805   /.cqs 6806   Basecbs 13352    /.s cqus 13623
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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
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-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-er 6807  df-ec 6809  df-qs 6813  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358
This theorem is used by:  qusaddf  13657  qusmulf  13659
  Copyright terms: Public domain W3C validator