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

Theorem riotaund 6048
Description: Restricted iota equals the empty set when not meaningful. (Contributed by NM, 16-Jan-2012.) (Revised by Mario Carneiro, 15-Oct-2016.) (Revised by NM, 13-Sep-2018.)
Assertion
Ref Expression
riotaund  |-  ( -.  E! x  e.  A  ph 
->  ( iota_ x  e.  A  ph )  =  (/) )
Distinct variable group:    x, A
Allowed substitution hint:    ph( x)

Proof of Theorem riotaund
StepHypRef Expression
1 df-riota 6011 . 2  |-  ( iota_ x  e.  A  ph )  =  ( iota x
( x  e.  A  /\  ph ) )
2 df-reu 2529 . . 3  |-  ( E! x  e.  A  ph  <->  E! x ( x  e.  A  /\  ph )
)
3 iotanul 5333 . . 3  |-  ( -.  E! x ( x  e.  A  /\  ph )  ->  ( iota x
( x  e.  A  /\  ph ) )  =  (/) )
42, 3sylnbi 685 . 2  |-  ( -.  E! x  e.  A  ph 
->  ( iota x ( x  e.  A  /\  ph ) )  =  (/) )
51, 4eqtrid 2279 1  |-  ( -.  E! x  e.  A  ph 
->  ( iota_ x  e.  A  ph )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1398   E!weu 2082    e. wcel 2205   E!wreu 2524   (/)c0 3512   iotacio 5315   iota_crio 6010
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-v 2817  df-dif 3216  df-in 3220  df-ss 3227  df-nul 3513  df-sn 3700  df-uni 3920  df-iota 5317  df-riota 6011
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator