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

Theorem fconstmpo 6173
Description: Representation of a constant operation using the mapping operation. (Contributed by SO, 11-Jul-2018.)
Assertion
Ref Expression
fconstmpo  |-  ( ( A  X.  B )  X.  { C }
)  =  ( x  e.  A ,  y  e.  B  |->  C )
Distinct variable groups:    x, A, y   
x, B, y    x, C, y

Proof of Theorem fconstmpo
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 fconstmpt 4817 . 2  |-  ( ( A  X.  B )  X.  { C }
)  =  ( z  e.  ( A  X.  B )  |->  C )
2 eqidd 2239 . . 3  |-  ( z  =  <. x ,  y
>.  ->  C  =  C )
32mpompt 6170 . 2  |-  ( z  e.  ( A  X.  B )  |->  C )  =  ( x  e.  A ,  y  e.  B  |->  C )
41, 3eqtri 2259 1  |-  ( ( A  X.  B )  X.  { C }
)  =  ( x  e.  A ,  y  e.  B  |->  C )
Colors of variables: wff set class
Syntax hints:    = wceq 1402   {csn 3705   <.cop 3708    |-> cmpt 4187    X. cxp 4767    e. cmpo 6077
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 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 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-iun 4009  df-opab 4188  df-mpt 4189  df-xp 4775  df-rel 4776  df-oprab 6079  df-mpo 6080
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator