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

Theorem fconstmpo 6115
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 4773 . 2  |-  ( ( A  X.  B )  X.  { C }
)  =  ( z  e.  ( A  X.  B )  |->  C )
2 eqidd 2232 . . 3  |-  ( z  =  <. x ,  y
>.  ->  C  =  C )
32mpompt 6112 . 2  |-  ( z  e.  ( A  X.  B )  |->  C )  =  ( x  e.  A ,  y  e.  B  |->  C )
41, 3eqtri 2252 1  |-  ( ( A  X.  B )  X.  { C }
)  =  ( x  e.  A ,  y  e.  B  |->  C )
Colors of variables: wff set class
Syntax hints:    = wceq 1397   {csn 3669   <.cop 3672    |-> cmpt 4150    X. cxp 4723    e. cmpo 6019
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-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  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-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-iun 3972  df-opab 4151  df-mpt 4152  df-xp 4731  df-rel 4732  df-oprab 6021  df-mpo 6022
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator