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

Theorem mpo0 5935
Description: A mapping operation with empty domain. (Contributed by Stefan O'Rear, 29-Jan-2015.) (Revised by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
mpo0  |-  ( x  e.  (/) ,  y  e.  B  |->  C )  =  (/)

Proof of Theorem mpo0
Dummy variables  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-mpo 5870 . 2  |-  ( x  e.  (/) ,  y  e.  B  |->  C )  =  { <. <. x ,  y
>. ,  z >.  |  ( ( x  e.  (/)  /\  y  e.  B
)  /\  z  =  C ) }
2 df-oprab 5869 . 2  |-  { <. <.
x ,  y >. ,  z >.  |  ( ( x  e.  (/)  /\  y  e.  B )  /\  z  =  C ) }  =  {
w  |  E. x E. y E. z ( w  =  <. <. x ,  y >. ,  z
>.  /\  ( ( x  e.  (/)  /\  y  e.  B )  /\  z  =  C ) ) }
3 noel 3424 . . . . . . 7  |-  -.  x  e.  (/)
4 simprll 537 . . . . . . 7  |-  ( ( w  =  <. <. x ,  y >. ,  z
>.  /\  ( ( x  e.  (/)  /\  y  e.  B )  /\  z  =  C ) )  ->  x  e.  (/) )
53, 4mto 662 . . . . . 6  |-  -.  (
w  =  <. <. x ,  y >. ,  z
>.  /\  ( ( x  e.  (/)  /\  y  e.  B )  /\  z  =  C ) )
65nex 1498 . . . . 5  |-  -.  E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\  ( ( x  e.  (/)  /\  y  e.  B
)  /\  z  =  C ) )
76nex 1498 . . . 4  |-  -.  E. y E. z ( w  =  <. <. x ,  y
>. ,  z >.  /\  ( ( x  e.  (/)  /\  y  e.  B
)  /\  z  =  C ) )
87nex 1498 . . 3  |-  -.  E. x E. y E. z
( w  =  <. <.
x ,  y >. ,  z >.  /\  (
( x  e.  (/)  /\  y  e.  B )  /\  z  =  C ) )
98abf 3464 . 2  |-  { w  |  E. x E. y E. z ( w  = 
<. <. x ,  y
>. ,  z >.  /\  ( ( x  e.  (/)  /\  y  e.  B
)  /\  z  =  C ) ) }  =  (/)
101, 2, 93eqtri 2200 1  |-  ( x  e.  (/) ,  y  e.  B  |->  C )  =  (/)
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1353   E.wex 1490    e. wcel 2146   {cab 2161   (/)c0 3420   <.cop 3592   {coprab 5866    e. cmpo 5867
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-in1 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-ext 2157
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-v 2737  df-dif 3129  df-in 3133  df-ss 3140  df-nul 3421  df-oprab 5869  df-mpo 5870
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator