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

Theorem riotaund 5957
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 5922 . 2  |-  ( iota_ x  e.  A  ph )  =  ( iota x
( x  e.  A  /\  ph ) )
2 df-reu 2493 . . 3  |-  ( E! x  e.  A  ph  <->  E! x ( x  e.  A  /\  ph )
)
3 iotanul 5266 . . 3  |-  ( -.  E! x ( x  e.  A  /\  ph )  ->  ( iota x
( x  e.  A  /\  ph ) )  =  (/) )
42, 3sylnbi 680 . 2  |-  ( -.  E! x  e.  A  ph 
->  ( iota x ( x  e.  A  /\  ph ) )  =  (/) )
51, 4eqtrid 2252 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 1373   E!weu 2055    e. wcel 2178   E!wreu 2488   (/)c0 3468   iotacio 5249   iota_crio 5921
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-reu 2493  df-v 2778  df-dif 3176  df-in 3180  df-ss 3187  df-nul 3469  df-sn 3649  df-uni 3865  df-iota 5251  df-riota 5922
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator