Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ex-natded9.26 Unicode version

Theorem ex-natded9.26 20664
Description: Theorem 9.26 of [Laboreo] p. 45, translated line by line using an interpretation of natural deduction in Metamath. This proof has some additional complications due to the fact that Metamath's existential elimination rule does not change bound variables, so we need to verify that is bound in the conclusion. For information about ND and Metamath, see the page on Deduction Form and Natural Deduction in Metamath Proof Explorer. The original proof, which uses Fitch style, was written as follows (the leading "..." shows an embedded ND hypothesis, beginning with the initial assumption of the ND hypothesis):
#MPE#ND Expression MPE TranslationND Rationale MPE Rationale
13 Given \$e.
26 ...| ND hypothesis assumption simpr 449. Later statements will have this scope.
37;5,4 ... E 2,y a4sbcd 2934 (E), 5,6. To use it we need a1i 12 and vex 2730. This could be immediately done with 19.21bi 1774, but we want to show the general approach for substitution.
412;8,9,10,11 ... I 3,a a4esbcd 3003 (I), 11. To use it we need sylibr 205, which in turn requires sylib 190 and two uses of sbcid 2937. This could be more immediately done using 19.8a 1758, but we want to show the general approach for substitution.
513;1,2 E 1,2,4,a exlimdd 1933 (E), 1,2,3,12. We'll need supporting assertions that the variable is free (not bound), as provided in nfv 1629 and nfe1 1566 (MPE# 1,2)
614 I 5 alrimiv 2012 (I), 13

The original used Latin letters for predicates; we have replaced them with Greek letters to follow Metamath naming conventions and so that it is easier to follow the Metamath translation. The Metamath line-for-line translation of this natural deduction approach precedes every line with an antecedent including and uses the Metamath equivalents of the natural deduction rules. Below is the final metamath proof (which reorders some steps).

Note that in the original proof, has explicit parameters. In Metamath, these parameters are always implicit, and the parameters upon which a wff variable can depend are recorded in the "allowed substitution hints" below.

A much more efficient proof, using more of Metamath and MPE's capabilities, is shown in ex-natded9.26-2 20665.

(Proof modification is discouraged.) (Contributed by Mario Carneiro, 9-Feb-2017.) (Revised by David A. Wheeler, 18-Feb-2017.)

Hypothesis
Ref Expression
ex-natded9.26.1
Assertion
Ref Expression
ex-natded9.26
Distinct variable group:   ,,
Allowed substitution hints:   (,)

Proof of Theorem ex-natded9.26
StepHypRef Expression
1 nfv 1629 . . 3
2 nfe1 1566 . . 3
3 ex-natded9.26.1 . . 3
4 vex 2730 . . . . . . . 8
54a1i 12 . . . . . . 7
6 simpr 449 . . . . . . 7
75, 6a4sbcd 2934 . . . . . 6
8 sbcid 2937 . . . . . 6
97, 8sylib 190 . . . . 5
10 sbcid 2937 . . . . 5
119, 10sylibr 205 . . . 4
1211a4esbcd 3003 . . 3
131, 2, 3, 12exlimdd 1933 . 2
1413alrimiv 2012 1
 Colors of variables: wff set class Syntax hints:   wi 6   wa 360  wal 1532  wex 1537   wcel 1621  cvv 2727  wsbc 2921 This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1926  ax-ext 2234 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1883  df-clab 2240  df-cleq 2246  df-clel 2249  df-nfc 2374  df-ral 2513  df-rex 2514  df-v 2729  df-sbc 2922
 Copyright terms: Public domain W3C validator