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

Theorem fconstmpo 5937
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 4651 . 2  |-  ( ( A  X.  B )  X.  { C }
)  =  ( z  e.  ( A  X.  B )  |->  C )
2 eqidd 2166 . . 3  |-  ( z  =  <. x ,  y
>.  ->  C  =  C )
32mpompt 5934 . 2  |-  ( z  e.  ( A  X.  B )  |->  C )  =  ( x  e.  A ,  y  e.  B  |->  C )
41, 3eqtri 2186 1  |-  ( ( A  X.  B )  X.  { C }
)  =  ( x  e.  A ,  y  e.  B  |->  C )
Colors of variables: wff set class
Syntax hints:    = wceq 1343   {csn 3576   <.cop 3579    |-> cmpt 4043    X. cxp 4602    e. cmpo 5844
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-iun 3868  df-opab 4044  df-mpt 4045  df-xp 4610  df-rel 4611  df-oprab 5846  df-mpo 5847
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator