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

Theorem r19.37 2507
 Description: Restricted version of one direction of Theorem 19.37 of [Margaris] p. 90. In classical logic the converse would hold if has at least one element, but that is not sufficient in intuitionistic logic. (Contributed by FL, 13-May-2012.) (Revised by Mario Carneiro, 11-Dec-2016.)
Hypothesis
Ref Expression
r19.37.1
Assertion
Ref Expression
r19.37

Proof of Theorem r19.37
StepHypRef Expression
1 r19.37.1 . . 3
2 ax-1 5 . . 3
31, 2ralrimi 2433 . 2
4 r19.35-1 2505 . 2
53, 4syl5 32 1
 Colors of variables: wff set class Syntax hints:   wi 4  wnf 1390   wcel 1434  wral 2349  wrex 2350 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1377  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-4 1441  ax-ial 1468 This theorem depends on definitions:  df-bi 115  df-nf 1391  df-ral 2354  df-rex 2355 This theorem is referenced by:  r19.37av  2508
 Copyright terms: Public domain W3C validator