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

Theorem r19.27mv 3317
Description: Restricted quantifier version of Theorem 19.27 of [Margaris] p. 90. It is valid only when the domain of quantification is inhabited. (Contributed by Jim Kingdon, 5-Aug-2018.)
Assertion
Ref Expression
r19.27mv  |-  ( E. x  x  e.  A  ->  ( A. x  e.  A  ( ph  /\  ps )  <->  ( A. x  e.  A  ph  /\  ps ) ) )
Distinct variable groups:    x, A    ps, x
Allowed substitution hint:    ph( x)

Proof of Theorem r19.27mv
StepHypRef Expression
1 nfv 1421 . 2  |-  F/ x ps
21r19.27m 3316 1  |-  ( E. x  x  e.  A  ->  ( A. x  e.  A  ( ph  /\  ps )  <->  ( A. x  e.  A  ph  /\  ps ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98   E.wex 1381    e. wcel 1393   A.wral 2306
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-nf 1350  df-cleq 2033  df-clel 2036  df-ral 2311
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator