úÎ!ý Á     Safe % stpQA prover system is consisted of a bunch of axioms and rules to apply between themstpJA theorem is consisted of an initial axiom and rules (ordered set) applied stp Based on  Fhttps://bor0.wordpress.com/2018/08/07/simple-theorem-prover-in-racket/.$A rule is a way to change a theorem. stp)An axiom is just a theorem already provenstp"Applies a single rule to a theoremstp0Applies all prover's rules to a list of theoremsstpÒMerge two list of proofs but skip duplicate proofs, giving the first argument priority This is used to avoid circular results in the search tree E.g. application of rules resulting in an earlier theorem/axiomstpPFinds a proof by constructing a proof tree by iteratively applying theorem rulesstpFind proof helper         !stp-0.1.0.1-RWetUQiz6AKvyv1k7bDLwSimpleTheoremProver TheoremProveraxiomsrulesThmProverTheoremaxiomrulesThmresultRulenamefunctionmkAxiom thmApplyRule thmApplyRules mergeProofs findProofIter findProof $fShowRule $fShowTheorem$fShowTheoremProver