Mathbox for Alan Sare < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sucidALTVD Structured version   Unicode version

Theorem sucidALTVD 28982
Description: A set belongs to its successor. Alternate proof of sucid 4660. The following User's Proof is a Virtual Deduction proof completed automatically by the tools program completeusersproof.cmd, which invokes Mel O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant. sucidALT 28983 is sucidALTVD 28982 without virtual deductions and was automatically derived from sucidALTVD 28982. This proof illustrates that completeusersproof.cmd will generate a Metamath proof from any User's Proof which is "conventional" in the sense that no step is a virtual deduction, provided that all necessary unification theorems and transformation deductions are in set.mm. completeusersproof.cmd automatically converts such a conventional proof into a Virtual Deduction proof for which each step happens to be a 0-virtual hypothesis virtual deduction. The user does not need to search for reference theorem labels or deduction labels nor does he(she) need to use theorems and deductions which unify with reference theorems and deductions in set.mm. All that is necessary is that each theorem or deduction of the User's Proof unifies with some reference theorem or deduction in set.mm or is a semantic variation of some theorem or deduction which unifies with some reference theorem or deduction in set.mm. The definition of "semantic variation" has not been precisely defined. If it is obvious that a theorem or deduction has the same meaning as another theorem or deduction, then it is a semantic variation of the latter theorem or deduction. For example, step 4 of the User's Proof is a semantic variation of the definition (axiom) , which unifies with df-suc 4587, a reference definition (axiom) in set.mm. Also, a theorem or deduction is said to be a semantic variation of another theorem or deduction if it is obvious upon cursory inspection that it has the same meaning as a weaker form of the latter theorem or deduction. For example, the deduction infers is a semantic variation of the theorem , which unifies with the set.mm reference definition (axiom) dford2 7575.
 h1:: 2:1: 3:2: 4:: qed:3,4:
(Contributed by Alan Sare, 18-Feb-2012.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
sucidALTVD.1
Assertion
Ref Expression
sucidALTVD

Proof of Theorem sucidALTVD
StepHypRef Expression
1 sucidALTVD.1 . . . 4
21snid 3841 . . 3
3 elun1 3514 . . 3
42, 3e0_ 28884 . 2
5 df-suc 4587 . . 3
65equncomi 3493 . 2
74, 6eleqtrri 2509 1
 Colors of variables: wff set class Syntax hints:   wcel 1725  cvv 2956   cun 3318  csn 3814   csuc 4583 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2417 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-v 2958  df-un 3325  df-in 3327  df-ss 3334  df-sn 3820  df-suc 4587
 Copyright terms: Public domain W3C validator