TSTP Solution File: LCL509+1 by Twee---2.5.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.5.0
% Problem : LCL509+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee /export/starexec/sandbox2/benchmark/theBenchmark.p --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 11:21:52 EDT 2024
% Result : Theorem 100.66s 13.01s
% Output : Proof 102.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL509+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.12 % Command : parallel-twee /export/starexec/sandbox2/benchmark/theBenchmark.p --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Jun 22 12:55:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 100.66/13.01 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 100.66/13.01
% 100.66/13.01 % SZS status Theorem
% 100.66/13.01
% 101.29/13.11 % SZS output start Proof
% 101.29/13.11 Take the following subset of the input axioms:
% 101.29/13.12 fof(and_1, axiom, and_1 <=> ![X, Y]: is_a_theorem(implies(and(X, Y), X))).
% 101.29/13.12 fof(cn2, axiom, cn2 <=> ![P, Q]: is_a_theorem(implies(P, implies(not(P), Q)))).
% 101.29/13.12 fof(cn3, axiom, cn3 <=> ![P2]: is_a_theorem(implies(implies(not(P2), P2), P2))).
% 101.29/13.12 fof(hilbert_or_1, conjecture, or_1).
% 101.29/13.12 fof(kn1, axiom, kn1 <=> ![P2]: is_a_theorem(implies(P2, and(P2, P2)))).
% 101.29/13.12 fof(kn2, axiom, kn2 <=> ![P2, Q2]: is_a_theorem(implies(and(P2, Q2), P2))).
% 101.29/13.12 fof(kn3, axiom, kn3 <=> ![R, P2, Q2]: is_a_theorem(implies(implies(P2, Q2), implies(not(and(Q2, R)), not(and(R, P2)))))).
% 101.29/13.12 fof(modus_ponens, axiom, modus_ponens <=> ![X2, Y2]: ((is_a_theorem(X2) & is_a_theorem(implies(X2, Y2))) => is_a_theorem(Y2))).
% 101.29/13.12 fof(op_equiv, axiom, op_equiv => ![X2, Y2]: equiv(X2, Y2)=and(implies(X2, Y2), implies(Y2, X2))).
% 101.29/13.12 fof(op_implies_and, axiom, op_implies_and => ![X2, Y2]: implies(X2, Y2)=not(and(X2, not(Y2)))).
% 101.29/13.12 fof(op_or, axiom, op_or => ![X2, Y2]: or(X2, Y2)=not(and(not(X2), not(Y2)))).
% 101.29/13.12 fof(or_1, axiom, or_1 <=> ![X2, Y2]: is_a_theorem(implies(X2, or(X2, Y2)))).
% 101.29/13.12 fof(r1, axiom, r1 <=> ![P2]: is_a_theorem(implies(or(P2, P2), P2))).
% 101.29/13.12 fof(r3, axiom, r3 <=> ![P2, Q2]: is_a_theorem(implies(or(P2, Q2), or(Q2, P2)))).
% 101.29/13.12 fof(rosser_kn1, axiom, kn1).
% 101.29/13.12 fof(rosser_kn2, axiom, kn2).
% 101.29/13.12 fof(rosser_kn3, axiom, kn3).
% 101.29/13.12 fof(rosser_modus_ponens, axiom, modus_ponens).
% 101.29/13.12 fof(rosser_op_equiv, axiom, op_equiv).
% 101.29/13.12 fof(rosser_op_implies_and, axiom, op_implies_and).
% 101.29/13.12 fof(rosser_op_or, axiom, op_or).
% 101.29/13.12
% 101.29/13.12 Now clausify the problem and encode Horn clauses using encoding 3 of
% 101.29/13.12 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 101.29/13.12 We repeatedly replace C & s=t => u=v by the two clauses:
% 101.29/13.12 fresh(y, y, x1...xn) = u
% 101.29/13.12 C => fresh(s, t, x1...xn) = v
% 101.29/13.12 where fresh is a fresh function symbol and x1..xn are the free
% 101.29/13.12 variables of u and v.
% 101.29/13.12 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 101.29/13.12 input problem has no model of domain size 1).
% 101.29/13.12
% 101.29/13.12 The encoding turns the above axioms into the following unit equations and goals:
% 101.29/13.12
% 101.29/13.12 Axiom 1 (rosser_modus_ponens): modus_ponens = true.
% 101.29/13.12 Axiom 2 (rosser_kn1): kn1 = true.
% 101.29/13.12 Axiom 3 (rosser_kn2): kn2 = true.
% 101.29/13.12 Axiom 4 (rosser_kn3): kn3 = true.
% 101.29/13.12 Axiom 5 (rosser_op_or): op_or = true.
% 101.29/13.12 Axiom 6 (rosser_op_implies_and): op_implies_and = true.
% 101.29/13.12 Axiom 7 (rosser_op_equiv): op_equiv = true.
% 101.29/13.12 Axiom 8 (and_1): fresh57(X, X) = true.
% 101.29/13.12 Axiom 9 (or_1): fresh19(X, X) = true.
% 101.29/13.12 Axiom 10 (modus_ponens_2): fresh60(X, X, Y) = true.
% 101.29/13.12 Axiom 11 (kn1_1): fresh33(X, X, Y) = true.
% 101.29/13.12 Axiom 12 (modus_ponens_2): fresh28(X, X, Y) = is_a_theorem(Y).
% 101.29/13.12 Axiom 13 (modus_ponens_2): fresh59(X, X, Y, Z) = fresh60(modus_ponens, true, Z).
% 101.29/13.12 Axiom 14 (kn2_1): fresh31(X, X, Y, Z) = true.
% 101.29/13.12 Axiom 15 (op_equiv): fresh23(X, X, Y, Z) = equiv(Y, Z).
% 101.29/13.12 Axiom 16 (op_implies_and): fresh22(X, X, Y, Z) = implies(Y, Z).
% 101.29/13.12 Axiom 17 (op_or): fresh20(X, X, Y, Z) = or(Y, Z).
% 101.29/13.12 Axiom 18 (op_implies_and): fresh22(op_implies_and, true, X, Y) = not(and(X, not(Y))).
% 101.29/13.12 Axiom 19 (kn3_1): fresh29(X, X, Y, Z, W) = true.
% 101.29/13.12 Axiom 20 (op_or): fresh20(op_or, true, X, Y) = not(and(not(X), not(Y))).
% 101.29/13.12 Axiom 21 (kn1_1): fresh33(kn1, true, X) = is_a_theorem(implies(X, and(X, X))).
% 101.29/13.12 Axiom 22 (or_1_1): fresh18(or_1, true, X, Y) = is_a_theorem(implies(X, or(X, Y))).
% 101.29/13.12 Axiom 23 (and_1_1): fresh58(and_1, true, X, Y) = is_a_theorem(implies(and(X, Y), X)).
% 101.29/13.12 Axiom 24 (kn2_1): fresh31(kn2, true, X, Y) = is_a_theorem(implies(and(X, Y), X)).
% 101.29/13.12 Axiom 25 (r1_1): fresh12(r1, true, X) = is_a_theorem(implies(or(X, X), X)).
% 101.29/13.12 Axiom 26 (op_equiv): fresh23(op_equiv, true, X, Y) = and(implies(X, Y), implies(Y, X)).
% 101.29/13.12 Axiom 27 (cn2_1): fresh49(cn2, true, X, Y) = is_a_theorem(implies(X, implies(not(X), Y))).
% 101.29/13.12 Axiom 28 (cn3_1): fresh47(cn3, true, X) = is_a_theorem(implies(implies(not(X), X), X)).
% 101.29/13.12 Axiom 29 (modus_ponens_2): fresh59(is_a_theorem(implies(X, Y)), true, X, Y) = fresh28(is_a_theorem(X), true, Y).
% 101.29/13.12 Axiom 30 (and_1): fresh57(is_a_theorem(implies(and(x9, y9), x9)), true) = and_1.
% 101.29/13.12 Axiom 31 (or_1): fresh19(is_a_theorem(implies(x6, or(x6, y6))), true) = or_1.
% 101.29/13.12 Axiom 32 (r3_1): fresh8(r3, true, X, Y) = is_a_theorem(implies(or(X, Y), or(Y, X))).
% 101.29/13.12 Axiom 33 (kn3_1): fresh29(kn3, true, X, Y, Z) = is_a_theorem(implies(implies(X, Y), implies(not(and(Y, Z)), not(and(Z, X))))).
% 101.29/13.12
% 101.29/13.12 Lemma 34: is_a_theorem(implies(and(X, Y), X)) = fresh58(and_1, modus_ponens, X, Y).
% 101.29/13.12 Proof:
% 101.29/13.12 is_a_theorem(implies(and(X, Y), X))
% 101.29/13.12 = { by axiom 23 (and_1_1) R->L }
% 101.29/13.12 fresh58(and_1, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh58(and_1, modus_ponens, X, Y)
% 101.29/13.12
% 101.29/13.12 Lemma 35: fresh58(and_1, modus_ponens, X, Y) = modus_ponens.
% 101.29/13.12 Proof:
% 101.29/13.12 fresh58(and_1, modus_ponens, X, Y)
% 101.29/13.12 = { by lemma 34 R->L }
% 101.29/13.12 is_a_theorem(implies(and(X, Y), X))
% 101.29/13.12 = { by axiom 24 (kn2_1) R->L }
% 101.29/13.12 fresh31(kn2, true, X, Y)
% 101.29/13.12 = { by axiom 3 (rosser_kn2) }
% 101.29/13.12 fresh31(true, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh31(modus_ponens, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh31(modus_ponens, modus_ponens, X, Y)
% 101.29/13.12 = { by axiom 14 (kn2_1) }
% 101.29/13.12 true
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 modus_ponens
% 101.29/13.12
% 101.29/13.12 Lemma 36: modus_ponens = and_1.
% 101.29/13.12 Proof:
% 101.29/13.12 modus_ponens
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) }
% 101.29/13.12 true
% 101.29/13.12 = { by axiom 8 (and_1) R->L }
% 101.29/13.12 fresh57(modus_ponens, modus_ponens)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) }
% 101.29/13.12 fresh57(modus_ponens, true)
% 101.29/13.12 = { by lemma 35 R->L }
% 101.29/13.12 fresh57(fresh58(and_1, modus_ponens, x9, y9), true)
% 101.29/13.12 = { by lemma 34 R->L }
% 101.29/13.12 fresh57(is_a_theorem(implies(and(x9, y9), x9)), true)
% 101.29/13.12 = { by axiom 30 (and_1) }
% 101.29/13.12 and_1
% 101.29/13.12
% 101.29/13.12 Lemma 37: and(implies(X, Y), implies(Y, X)) = equiv(X, Y).
% 101.29/13.12 Proof:
% 101.29/13.12 and(implies(X, Y), implies(Y, X))
% 101.29/13.12 = { by axiom 26 (op_equiv) R->L }
% 101.29/13.12 fresh23(op_equiv, true, X, Y)
% 101.29/13.12 = { by axiom 7 (rosser_op_equiv) }
% 101.29/13.12 fresh23(true, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh23(modus_ponens, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh23(modus_ponens, modus_ponens, X, Y)
% 101.29/13.12 = { by axiom 15 (op_equiv) }
% 101.29/13.12 equiv(X, Y)
% 101.29/13.12
% 101.29/13.12 Lemma 38: fresh59(is_a_theorem(implies(X, Y)), modus_ponens, X, Y) = fresh28(is_a_theorem(X), modus_ponens, Y).
% 101.29/13.12 Proof:
% 101.29/13.12 fresh59(is_a_theorem(implies(X, Y)), modus_ponens, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) }
% 101.29/13.12 fresh59(is_a_theorem(implies(X, Y)), true, X, Y)
% 101.29/13.12 = { by axiom 29 (modus_ponens_2) }
% 101.29/13.12 fresh28(is_a_theorem(X), true, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh28(is_a_theorem(X), modus_ponens, Y)
% 101.29/13.12
% 101.29/13.12 Lemma 39: not(and(X, not(Y))) = implies(X, Y).
% 101.29/13.12 Proof:
% 101.29/13.12 not(and(X, not(Y)))
% 101.29/13.12 = { by axiom 18 (op_implies_and) R->L }
% 101.29/13.12 fresh22(op_implies_and, true, X, Y)
% 101.29/13.12 = { by axiom 6 (rosser_op_implies_and) }
% 101.29/13.12 fresh22(true, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh22(modus_ponens, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh22(modus_ponens, modus_ponens, X, Y)
% 101.29/13.12 = { by axiom 16 (op_implies_and) }
% 101.29/13.12 implies(X, Y)
% 101.29/13.12
% 101.29/13.12 Lemma 40: implies(not(X), Y) = or(X, Y).
% 101.29/13.12 Proof:
% 101.29/13.12 implies(not(X), Y)
% 101.29/13.12 = { by lemma 39 R->L }
% 101.29/13.12 not(and(not(X), not(Y)))
% 101.29/13.12 = { by axiom 20 (op_or) R->L }
% 101.29/13.12 fresh20(op_or, true, X, Y)
% 101.29/13.12 = { by axiom 5 (rosser_op_or) }
% 101.29/13.12 fresh20(true, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh20(modus_ponens, true, X, Y)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh20(modus_ponens, modus_ponens, X, Y)
% 101.29/13.12 = { by axiom 17 (op_or) }
% 101.29/13.12 or(X, Y)
% 101.29/13.12
% 101.29/13.12 Lemma 41: fresh60(X, X, Y) = modus_ponens.
% 101.29/13.12 Proof:
% 101.29/13.12 fresh60(X, X, Y)
% 101.29/13.12 = { by axiom 10 (modus_ponens_2) }
% 101.29/13.12 true
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 modus_ponens
% 101.29/13.12
% 101.29/13.12 Lemma 42: fresh59(X, X, Y, Z) = modus_ponens.
% 101.29/13.12 Proof:
% 101.29/13.12 fresh59(X, X, Y, Z)
% 101.29/13.12 = { by axiom 13 (modus_ponens_2) }
% 101.29/13.12 fresh60(modus_ponens, true, Z)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh60(modus_ponens, modus_ponens, Z)
% 101.29/13.12 = { by lemma 41 }
% 101.29/13.12 modus_ponens
% 101.29/13.12
% 101.29/13.12 Lemma 43: is_a_theorem(implies(implies(X, Y), or(and(Y, Z), not(and(Z, X))))) = and_1.
% 101.29/13.12 Proof:
% 101.29/13.12 is_a_theorem(implies(implies(X, Y), or(and(Y, Z), not(and(Z, X)))))
% 101.29/13.12 = { by lemma 40 R->L }
% 101.29/13.12 is_a_theorem(implies(implies(X, Y), implies(not(and(Y, Z)), not(and(Z, X)))))
% 101.29/13.12 = { by axiom 33 (kn3_1) R->L }
% 101.29/13.12 fresh29(kn3, true, X, Y, Z)
% 101.29/13.12 = { by axiom 4 (rosser_kn3) }
% 101.29/13.12 fresh29(true, true, X, Y, Z)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh29(modus_ponens, true, X, Y, Z)
% 101.29/13.12 = { by lemma 36 }
% 101.29/13.12 fresh29(and_1, true, X, Y, Z)
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 fresh29(and_1, modus_ponens, X, Y, Z)
% 101.29/13.12 = { by lemma 36 }
% 101.29/13.12 fresh29(and_1, and_1, X, Y, Z)
% 101.29/13.12 = { by axiom 19 (kn3_1) }
% 101.29/13.12 true
% 101.29/13.12 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.12 modus_ponens
% 101.29/13.12 = { by lemma 36 }
% 101.29/13.12 and_1
% 101.29/13.12
% 101.29/13.12 Lemma 44: fresh28(is_a_theorem(implies(X, Y)), and_1, or(and(Y, Z), not(and(Z, X)))) = and_1.
% 101.29/13.12 Proof:
% 101.29/13.12 fresh28(is_a_theorem(implies(X, Y)), and_1, or(and(Y, Z), not(and(Z, X))))
% 101.29/13.12 = { by lemma 36 R->L }
% 101.29/13.13 fresh28(is_a_theorem(implies(X, Y)), modus_ponens, or(and(Y, Z), not(and(Z, X))))
% 101.29/13.13 = { by lemma 38 R->L }
% 101.29/13.13 fresh59(is_a_theorem(implies(implies(X, Y), or(and(Y, Z), not(and(Z, X))))), modus_ponens, implies(X, Y), or(and(Y, Z), not(and(Z, X))))
% 101.29/13.13 = { by lemma 43 }
% 101.29/13.13 fresh59(and_1, modus_ponens, implies(X, Y), or(and(Y, Z), not(and(Z, X))))
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 fresh59(and_1, and_1, implies(X, Y), or(and(Y, Z), not(and(Z, X))))
% 101.29/13.13 = { by lemma 42 }
% 101.29/13.13 modus_ponens
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 and_1
% 101.29/13.13
% 101.29/13.13 Lemma 45: is_a_theorem(implies(X, and(X, X))) = modus_ponens.
% 101.29/13.13 Proof:
% 101.29/13.13 is_a_theorem(implies(X, and(X, X)))
% 101.29/13.13 = { by axiom 21 (kn1_1) R->L }
% 101.29/13.13 fresh33(kn1, true, X)
% 101.29/13.13 = { by axiom 2 (rosser_kn1) }
% 101.29/13.13 fresh33(true, true, X)
% 101.29/13.13 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.13 fresh33(modus_ponens, true, X)
% 101.29/13.13 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.13 fresh33(modus_ponens, modus_ponens, X)
% 101.29/13.13 = { by axiom 11 (kn1_1) }
% 101.29/13.13 true
% 101.29/13.13 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.13 modus_ponens
% 101.29/13.13
% 101.29/13.13 Lemma 46: or(and(X, not(Y)), Z) = implies(implies(X, Y), Z).
% 101.29/13.13 Proof:
% 101.29/13.13 or(and(X, not(Y)), Z)
% 101.29/13.13 = { by lemma 40 R->L }
% 101.29/13.13 implies(not(and(X, not(Y))), Z)
% 101.29/13.13 = { by lemma 39 }
% 101.29/13.13 implies(implies(X, Y), Z)
% 101.29/13.13
% 101.29/13.13 Lemma 47: is_a_theorem(implies(or(X, Y), or(and(Y, Z), implies(Z, X)))) = and_1.
% 101.29/13.13 Proof:
% 101.29/13.13 is_a_theorem(implies(or(X, Y), or(and(Y, Z), implies(Z, X))))
% 101.29/13.13 = { by lemma 40 R->L }
% 101.29/13.13 is_a_theorem(implies(implies(not(X), Y), or(and(Y, Z), implies(Z, X))))
% 101.29/13.13 = { by lemma 39 R->L }
% 101.29/13.13 is_a_theorem(implies(implies(not(X), Y), or(and(Y, Z), not(and(Z, not(X))))))
% 101.29/13.13 = { by lemma 43 }
% 101.29/13.13 and_1
% 101.29/13.13
% 101.29/13.13 Lemma 48: fresh28(is_a_theorem(or(X, Y)), and_1, implies(implies(Y, Z), or(Z, X))) = and_1.
% 101.29/13.13 Proof:
% 101.29/13.13 fresh28(is_a_theorem(or(X, Y)), and_1, implies(implies(Y, Z), or(Z, X)))
% 101.29/13.13 = { by lemma 36 R->L }
% 101.29/13.13 fresh28(is_a_theorem(or(X, Y)), modus_ponens, implies(implies(Y, Z), or(Z, X)))
% 101.29/13.13 = { by lemma 38 R->L }
% 101.29/13.13 fresh59(is_a_theorem(implies(or(X, Y), implies(implies(Y, Z), or(Z, X)))), modus_ponens, or(X, Y), implies(implies(Y, Z), or(Z, X)))
% 101.29/13.13 = { by lemma 46 R->L }
% 101.29/13.13 fresh59(is_a_theorem(implies(or(X, Y), or(and(Y, not(Z)), or(Z, X)))), modus_ponens, or(X, Y), implies(implies(Y, Z), or(Z, X)))
% 101.29/13.13 = { by lemma 40 R->L }
% 101.29/13.13 fresh59(is_a_theorem(implies(or(X, Y), or(and(Y, not(Z)), implies(not(Z), X)))), modus_ponens, or(X, Y), implies(implies(Y, Z), or(Z, X)))
% 101.29/13.13 = { by lemma 47 }
% 101.29/13.13 fresh59(and_1, modus_ponens, or(X, Y), implies(implies(Y, Z), or(Z, X)))
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 fresh59(and_1, and_1, or(X, Y), implies(implies(Y, Z), or(Z, X)))
% 101.29/13.13 = { by lemma 42 }
% 101.29/13.13 modus_ponens
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 and_1
% 101.29/13.13
% 101.29/13.13 Lemma 49: fresh28(is_a_theorem(implies(X, Y)), and_1, or(Y, not(X))) = and_1.
% 101.29/13.13 Proof:
% 101.29/13.13 fresh28(is_a_theorem(implies(X, Y)), and_1, or(Y, not(X)))
% 101.29/13.13 = { by lemma 36 R->L }
% 101.29/13.13 fresh28(is_a_theorem(implies(X, Y)), modus_ponens, or(Y, not(X)))
% 101.29/13.13 = { by lemma 38 R->L }
% 101.29/13.13 fresh59(is_a_theorem(implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.13 fresh59(fresh28(and_1, and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 36 R->L }
% 101.29/13.13 fresh59(fresh28(modus_ponens, and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 42 R->L }
% 101.29/13.13 fresh59(fresh28(fresh59(and_1, and_1, not(and(and(not(X), not(X)), not(not(X)))), not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 44 R->L }
% 101.29/13.13 fresh59(fresh28(fresh59(fresh28(is_a_theorem(implies(not(X), and(not(X), not(X)))), and_1, or(and(and(not(X), not(X)), not(not(X))), not(and(not(not(X)), not(X))))), and_1, not(and(and(not(X), not(X)), not(not(X)))), not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 45 }
% 101.29/13.13 fresh59(fresh28(fresh59(fresh28(modus_ponens, and_1, or(and(and(not(X), not(X)), not(not(X))), not(and(not(not(X)), not(X))))), and_1, not(and(and(not(X), not(X)), not(not(X)))), not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 fresh59(fresh28(fresh59(fresh28(and_1, and_1, or(and(and(not(X), not(X)), not(not(X))), not(and(not(not(X)), not(X))))), and_1, not(and(and(not(X), not(X)), not(not(X)))), not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by axiom 12 (modus_ponens_2) }
% 101.29/13.13 fresh59(fresh28(fresh59(is_a_theorem(or(and(and(not(X), not(X)), not(not(X))), not(and(not(not(X)), not(X))))), and_1, not(and(and(not(X), not(X)), not(not(X)))), not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 36 R->L }
% 101.29/13.13 fresh59(fresh28(fresh59(is_a_theorem(or(and(and(not(X), not(X)), not(not(X))), not(and(not(not(X)), not(X))))), modus_ponens, not(and(and(not(X), not(X)), not(not(X)))), not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 40 R->L }
% 101.29/13.13 fresh59(fresh28(fresh59(is_a_theorem(implies(not(and(and(not(X), not(X)), not(not(X)))), not(and(not(not(X)), not(X))))), modus_ponens, not(and(and(not(X), not(X)), not(not(X)))), not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 38 }
% 101.29/13.13 fresh59(fresh28(fresh28(is_a_theorem(not(and(and(not(X), not(X)), not(not(X))))), modus_ponens, not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 fresh59(fresh28(fresh28(is_a_theorem(not(and(and(not(X), not(X)), not(not(X))))), and_1, not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 39 }
% 101.29/13.13 fresh59(fresh28(fresh28(is_a_theorem(implies(and(not(X), not(X)), not(X))), and_1, not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 34 }
% 101.29/13.13 fresh59(fresh28(fresh28(fresh58(and_1, modus_ponens, not(X), not(X)), and_1, not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 35 }
% 101.29/13.13 fresh59(fresh28(fresh28(modus_ponens, and_1, not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 fresh59(fresh28(fresh28(and_1, and_1, not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by axiom 12 (modus_ponens_2) }
% 101.29/13.13 fresh59(fresh28(is_a_theorem(not(and(not(not(X)), not(X)))), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 39 }
% 101.29/13.13 fresh59(fresh28(is_a_theorem(implies(not(not(X)), X)), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 40 }
% 101.29/13.13 fresh59(fresh28(is_a_theorem(or(not(X), X)), and_1, implies(implies(X, Y), or(Y, not(X)))), modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 48 }
% 101.29/13.13 fresh59(and_1, modus_ponens, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 fresh59(and_1, and_1, implies(X, Y), or(Y, not(X)))
% 101.29/13.13 = { by lemma 42 }
% 101.29/13.13 modus_ponens
% 101.29/13.13 = { by lemma 36 }
% 101.29/13.13 and_1
% 101.29/13.13
% 101.29/13.13 Lemma 50: is_a_theorem(or(X, not(and(X, Y)))) = and_1.
% 101.29/13.13 Proof:
% 101.29/13.13 is_a_theorem(or(X, not(and(X, Y))))
% 101.29/13.14 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.14 fresh28(and_1, and_1, or(X, not(and(X, Y))))
% 101.29/13.14 = { by lemma 36 R->L }
% 101.29/13.14 fresh28(modus_ponens, and_1, or(X, not(and(X, Y))))
% 101.29/13.14 = { by lemma 35 R->L }
% 101.29/13.14 fresh28(fresh58(and_1, modus_ponens, X, Y), and_1, or(X, not(and(X, Y))))
% 101.29/13.14 = { by lemma 34 R->L }
% 101.29/13.14 fresh28(is_a_theorem(implies(and(X, Y), X)), and_1, or(X, not(and(X, Y))))
% 101.29/13.14 = { by lemma 49 }
% 101.29/13.14 and_1
% 101.29/13.14
% 101.29/13.14 Lemma 51: fresh28(is_a_theorem(or(and(X, Y), Z)), and_1, or(Z, X)) = and_1.
% 101.29/13.14 Proof:
% 101.29/13.14 fresh28(is_a_theorem(or(and(X, Y), Z)), and_1, or(Z, X))
% 101.29/13.14 = { by lemma 36 R->L }
% 101.29/13.14 fresh28(is_a_theorem(or(and(X, Y), Z)), modus_ponens, or(Z, X))
% 101.29/13.14 = { by lemma 38 R->L }
% 101.29/13.14 fresh59(is_a_theorem(implies(or(and(X, Y), Z), or(Z, X))), modus_ponens, or(and(X, Y), Z), or(Z, X))
% 101.29/13.14 = { by lemma 40 R->L }
% 101.29/13.14 fresh59(is_a_theorem(implies(implies(not(and(X, Y)), Z), or(Z, X))), modus_ponens, or(and(X, Y), Z), or(Z, X))
% 101.29/13.14 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.14 fresh59(fresh28(and_1, and_1, implies(implies(not(and(X, Y)), Z), or(Z, X))), modus_ponens, or(and(X, Y), Z), or(Z, X))
% 101.29/13.14 = { by lemma 50 R->L }
% 101.29/13.14 fresh59(fresh28(is_a_theorem(or(X, not(and(X, Y)))), and_1, implies(implies(not(and(X, Y)), Z), or(Z, X))), modus_ponens, or(and(X, Y), Z), or(Z, X))
% 101.29/13.14 = { by lemma 48 }
% 101.29/13.14 fresh59(and_1, modus_ponens, or(and(X, Y), Z), or(Z, X))
% 101.29/13.14 = { by lemma 36 }
% 101.29/13.14 fresh59(and_1, and_1, or(and(X, Y), Z), or(Z, X))
% 101.29/13.14 = { by lemma 42 }
% 101.29/13.14 modus_ponens
% 101.29/13.14 = { by lemma 36 }
% 101.29/13.14 and_1
% 101.29/13.14
% 101.29/13.14 Lemma 52: is_a_theorem(or(X, implies(X, Y))) = and_1.
% 101.29/13.14 Proof:
% 101.29/13.14 is_a_theorem(or(X, implies(X, Y)))
% 101.29/13.14 = { by lemma 39 R->L }
% 101.29/13.14 is_a_theorem(or(X, not(and(X, not(Y)))))
% 101.29/13.14 = { by lemma 50 }
% 101.29/13.14 and_1
% 101.29/13.14
% 101.29/13.14 Lemma 53: is_a_theorem(or(X, and(not(X), not(X)))) = and_1.
% 101.29/13.14 Proof:
% 101.29/13.14 is_a_theorem(or(X, and(not(X), not(X))))
% 101.29/13.14 = { by lemma 40 R->L }
% 101.29/13.14 is_a_theorem(implies(not(X), and(not(X), not(X))))
% 101.29/13.14 = { by lemma 45 }
% 101.29/13.14 modus_ponens
% 101.29/13.14 = { by lemma 36 }
% 101.29/13.14 and_1
% 101.29/13.14
% 101.29/13.14 Lemma 54: is_a_theorem(equiv(X, X)) = and_1.
% 101.29/13.14 Proof:
% 101.29/13.14 is_a_theorem(equiv(X, X))
% 101.29/13.14 = { by lemma 37 R->L }
% 101.29/13.14 is_a_theorem(and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.14 fresh28(and_1, and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 51 R->L }
% 101.29/13.14 fresh28(fresh28(is_a_theorem(or(and(implies(X, X), X), implies(X, X))), and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.14 fresh28(fresh28(fresh28(and_1, and_1, or(and(implies(X, X), X), implies(X, X))), and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 52 R->L }
% 101.29/13.14 fresh28(fresh28(fresh28(is_a_theorem(or(X, implies(X, X))), and_1, or(and(implies(X, X), X), implies(X, X))), and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 36 R->L }
% 101.29/13.14 fresh28(fresh28(fresh28(is_a_theorem(or(X, implies(X, X))), modus_ponens, or(and(implies(X, X), X), implies(X, X))), and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 38 R->L }
% 101.29/13.14 fresh28(fresh28(fresh59(is_a_theorem(implies(or(X, implies(X, X)), or(and(implies(X, X), X), implies(X, X)))), modus_ponens, or(X, implies(X, X)), or(and(implies(X, X), X), implies(X, X))), and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 47 }
% 101.29/13.14 fresh28(fresh28(fresh59(and_1, modus_ponens, or(X, implies(X, X)), or(and(implies(X, X), X), implies(X, X))), and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 36 }
% 101.29/13.14 fresh28(fresh28(fresh59(and_1, and_1, or(X, implies(X, X)), or(and(implies(X, X), X), implies(X, X))), and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 42 }
% 101.29/13.14 fresh28(fresh28(modus_ponens, and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 36 }
% 101.29/13.14 fresh28(fresh28(and_1, and_1, or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by axiom 12 (modus_ponens_2) }
% 101.29/13.14 fresh28(is_a_theorem(or(implies(X, X), implies(X, X))), and_1, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 36 R->L }
% 101.29/13.14 fresh28(is_a_theorem(or(implies(X, X), implies(X, X))), modus_ponens, and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 38 R->L }
% 101.29/13.14 fresh59(is_a_theorem(implies(or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 40 R->L }
% 101.29/13.14 fresh59(is_a_theorem(implies(implies(not(implies(X, X)), implies(X, X)), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 46 R->L }
% 101.29/13.14 fresh59(is_a_theorem(or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.14 fresh59(fresh28(and_1, and_1, or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 53 R->L }
% 101.29/13.14 fresh59(fresh28(is_a_theorem(or(implies(X, X), and(not(implies(X, X)), not(implies(X, X))))), and_1, or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 36 R->L }
% 101.29/13.14 fresh59(fresh28(is_a_theorem(or(implies(X, X), and(not(implies(X, X)), not(implies(X, X))))), modus_ponens, or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 38 R->L }
% 101.29/13.14 fresh59(fresh59(is_a_theorem(implies(or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X))))), modus_ponens, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 40 R->L }
% 101.29/13.14 fresh59(fresh59(is_a_theorem(implies(implies(not(implies(X, X)), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X))))), modus_ponens, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.14 fresh59(fresh59(fresh28(and_1, and_1, implies(implies(not(implies(X, X)), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X))))), modus_ponens, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 49 R->L }
% 101.29/13.14 fresh59(fresh59(fresh28(fresh28(is_a_theorem(implies(implies(X, X), and(implies(X, X), implies(X, X)))), and_1, or(and(implies(X, X), implies(X, X)), not(implies(X, X)))), and_1, implies(implies(not(implies(X, X)), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X))))), modus_ponens, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.14 = { by lemma 45 }
% 101.29/13.15 fresh59(fresh59(fresh28(fresh28(modus_ponens, and_1, or(and(implies(X, X), implies(X, X)), not(implies(X, X)))), and_1, implies(implies(not(implies(X, X)), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X))))), modus_ponens, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.15 = { by lemma 36 }
% 101.29/13.15 fresh59(fresh59(fresh28(fresh28(and_1, and_1, or(and(implies(X, X), implies(X, X)), not(implies(X, X)))), and_1, implies(implies(not(implies(X, X)), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X))))), modus_ponens, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.15 = { by axiom 12 (modus_ponens_2) }
% 101.29/13.15 fresh59(fresh59(fresh28(is_a_theorem(or(and(implies(X, X), implies(X, X)), not(implies(X, X)))), and_1, implies(implies(not(implies(X, X)), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X))))), modus_ponens, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.15 = { by lemma 48 }
% 101.29/13.15 fresh59(fresh59(and_1, modus_ponens, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.15 = { by lemma 36 }
% 101.29/13.16 fresh59(fresh59(and_1, and_1, or(implies(X, X), and(not(implies(X, X)), not(implies(X, X)))), or(and(not(implies(X, X)), not(implies(X, X))), and(implies(X, X), implies(X, X)))), modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.16 = { by lemma 42 }
% 101.29/13.16 fresh59(modus_ponens, modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.16 = { by lemma 36 }
% 101.29/13.16 fresh59(and_1, modus_ponens, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.16 = { by lemma 36 }
% 101.29/13.16 fresh59(and_1, and_1, or(implies(X, X), implies(X, X)), and(implies(X, X), implies(X, X)))
% 101.29/13.16 = { by lemma 42 }
% 101.29/13.16 modus_ponens
% 101.29/13.16 = { by lemma 36 }
% 101.29/13.16 and_1
% 101.29/13.16
% 101.29/13.16 Lemma 55: is_a_theorem(implies(or(X, X), X)) = fresh12(r1, modus_ponens, X).
% 101.29/13.16 Proof:
% 101.29/13.16 is_a_theorem(implies(or(X, X), X))
% 101.29/13.16 = { by axiom 25 (r1_1) R->L }
% 101.29/13.16 fresh12(r1, true, X)
% 101.29/13.16 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.16 fresh12(r1, modus_ponens, X)
% 101.29/13.16
% 101.29/13.16 Lemma 56: fresh12(r1, modus_ponens, X) = fresh47(cn3, modus_ponens, X).
% 101.29/13.16 Proof:
% 101.29/13.16 fresh12(r1, modus_ponens, X)
% 101.29/13.16 = { by lemma 55 R->L }
% 101.29/13.16 is_a_theorem(implies(or(X, X), X))
% 101.29/13.16 = { by lemma 40 R->L }
% 101.29/13.16 is_a_theorem(implies(implies(not(X), X), X))
% 101.29/13.16 = { by axiom 28 (cn3_1) R->L }
% 101.29/13.16 fresh47(cn3, true, X)
% 101.29/13.16 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.16 fresh47(cn3, modus_ponens, X)
% 101.29/13.16
% 101.29/13.16 Lemma 57: is_a_theorem(implies(X, or(X, Y))) = fresh18(or_1, modus_ponens, X, Y).
% 101.29/13.16 Proof:
% 101.29/13.16 is_a_theorem(implies(X, or(X, Y)))
% 101.29/13.16 = { by axiom 22 (or_1_1) R->L }
% 101.29/13.16 fresh18(or_1, true, X, Y)
% 101.29/13.16 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.16 fresh18(or_1, modus_ponens, X, Y)
% 101.29/13.16
% 101.29/13.16 Lemma 58: fresh18(or_1, modus_ponens, X, Y) = fresh49(cn2, modus_ponens, X, Y).
% 101.29/13.16 Proof:
% 101.29/13.16 fresh18(or_1, modus_ponens, X, Y)
% 101.29/13.16 = { by lemma 57 R->L }
% 101.29/13.16 is_a_theorem(implies(X, or(X, Y)))
% 101.29/13.16 = { by lemma 40 R->L }
% 101.29/13.16 is_a_theorem(implies(X, implies(not(X), Y)))
% 101.29/13.16 = { by axiom 27 (cn2_1) R->L }
% 101.29/13.16 fresh49(cn2, true, X, Y)
% 101.29/13.16 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.16 fresh49(cn2, modus_ponens, X, Y)
% 101.29/13.16
% 101.29/13.16 Lemma 59: is_a_theorem(implies(or(X, Y), or(Y, X))) = fresh8(r3, and_1, X, Y).
% 101.29/13.16 Proof:
% 101.29/13.16 is_a_theorem(implies(or(X, Y), or(Y, X)))
% 101.29/13.16 = { by axiom 32 (r3_1) R->L }
% 101.29/13.16 fresh8(r3, true, X, Y)
% 101.29/13.16 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.16 fresh8(r3, modus_ponens, X, Y)
% 101.29/13.16 = { by lemma 36 }
% 101.29/13.16 fresh8(r3, and_1, X, Y)
% 101.29/13.16
% 101.29/13.16 Lemma 60: fresh28(is_a_theorem(equiv(X, Y)), and_1, implies(X, Y)) = and_1.
% 101.29/13.16 Proof:
% 101.29/13.16 fresh28(is_a_theorem(equiv(X, Y)), and_1, implies(X, Y))
% 101.29/13.16 = { by lemma 37 R->L }
% 101.29/13.16 fresh28(is_a_theorem(and(implies(X, Y), implies(Y, X))), and_1, implies(X, Y))
% 101.29/13.16 = { by lemma 36 R->L }
% 101.29/13.16 fresh28(is_a_theorem(and(implies(X, Y), implies(Y, X))), modus_ponens, implies(X, Y))
% 101.29/13.16 = { by lemma 38 R->L }
% 101.29/13.16 fresh59(is_a_theorem(implies(and(implies(X, Y), implies(Y, X)), implies(X, Y))), modus_ponens, and(implies(X, Y), implies(Y, X)), implies(X, Y))
% 101.29/13.16 = { by lemma 34 }
% 101.29/13.16 fresh59(fresh58(and_1, modus_ponens, implies(X, Y), implies(Y, X)), modus_ponens, and(implies(X, Y), implies(Y, X)), implies(X, Y))
% 101.29/13.16 = { by lemma 35 }
% 101.29/13.16 fresh59(modus_ponens, modus_ponens, and(implies(X, Y), implies(Y, X)), implies(X, Y))
% 101.29/13.16 = { by lemma 42 }
% 101.29/13.16 modus_ponens
% 101.29/13.16 = { by lemma 36 }
% 101.29/13.16 and_1
% 101.29/13.16
% 101.29/13.16 Lemma 61: fresh28(is_a_theorem(or(X, Y)), and_1, or(Y, X)) = and_1.
% 101.29/13.16 Proof:
% 101.29/13.16 fresh28(is_a_theorem(or(X, Y)), and_1, or(Y, X))
% 101.29/13.16 = { by lemma 36 R->L }
% 101.29/13.16 fresh28(is_a_theorem(or(X, Y)), modus_ponens, or(Y, X))
% 101.29/13.16 = { by lemma 38 R->L }
% 101.29/13.16 fresh59(is_a_theorem(implies(or(X, Y), or(Y, X))), modus_ponens, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 59 }
% 101.29/13.16 fresh59(fresh8(r3, and_1, X, Y), modus_ponens, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 36 }
% 101.29/13.16 fresh59(fresh8(r3, and_1, X, Y), and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 59 R->L }
% 101.29/13.16 fresh59(is_a_theorem(implies(or(X, Y), or(Y, X))), and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 40 R->L }
% 101.29/13.16 fresh59(is_a_theorem(implies(implies(not(X), Y), or(Y, X))), and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.16 fresh59(fresh28(and_1, and_1, implies(implies(not(X), Y), or(Y, X))), and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 60 R->L }
% 101.29/13.16 fresh59(fresh28(fresh28(is_a_theorem(equiv(not(X), not(X))), and_1, implies(not(X), not(X))), and_1, implies(implies(not(X), Y), or(Y, X))), and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 40 }
% 101.29/13.16 fresh59(fresh28(fresh28(is_a_theorem(equiv(not(X), not(X))), and_1, or(X, not(X))), and_1, implies(implies(not(X), Y), or(Y, X))), and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 54 }
% 101.29/13.16 fresh59(fresh28(fresh28(and_1, and_1, or(X, not(X))), and_1, implies(implies(not(X), Y), or(Y, X))), and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by axiom 12 (modus_ponens_2) }
% 101.29/13.16 fresh59(fresh28(is_a_theorem(or(X, not(X))), and_1, implies(implies(not(X), Y), or(Y, X))), and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 48 }
% 101.29/13.16 fresh59(and_1, and_1, or(X, Y), or(Y, X))
% 101.29/13.16 = { by lemma 42 }
% 101.29/13.16 modus_ponens
% 101.29/13.16 = { by lemma 36 }
% 101.29/13.16 and_1
% 101.29/13.16
% 101.29/13.16 Lemma 62: fresh28(is_a_theorem(or(X, not(Y))), and_1, implies(or(Y, Z), or(Z, X))) = and_1.
% 101.29/13.16 Proof:
% 101.29/13.16 fresh28(is_a_theorem(or(X, not(Y))), and_1, implies(or(Y, Z), or(Z, X)))
% 101.29/13.16 = { by lemma 40 R->L }
% 101.29/13.16 fresh28(is_a_theorem(or(X, not(Y))), and_1, implies(implies(not(Y), Z), or(Z, X)))
% 101.29/13.16 = { by lemma 48 }
% 101.29/13.17 and_1
% 101.29/13.17
% 101.29/13.17 Goal 1 (hilbert_or_1): or_1 = true.
% 101.29/13.17 Proof:
% 101.29/13.17 or_1
% 101.29/13.17 = { by axiom 31 (or_1) R->L }
% 101.29/13.17 fresh19(is_a_theorem(implies(x6, or(x6, y6))), true)
% 101.29/13.17 = { by lemma 57 }
% 101.29/13.17 fresh19(fresh18(or_1, modus_ponens, x6, y6), true)
% 101.29/13.17 = { by lemma 58 }
% 101.29/13.17 fresh19(fresh49(cn2, modus_ponens, x6, y6), true)
% 101.29/13.17 = { by lemma 36 }
% 101.29/13.17 fresh19(fresh49(cn2, and_1, x6, y6), true)
% 101.29/13.17 = { by axiom 1 (rosser_modus_ponens) R->L }
% 101.29/13.17 fresh19(fresh49(cn2, and_1, x6, y6), modus_ponens)
% 101.29/13.17 = { by lemma 36 }
% 101.29/13.17 fresh19(fresh49(cn2, and_1, x6, y6), and_1)
% 101.29/13.17 = { by lemma 36 R->L }
% 101.29/13.17 fresh19(fresh49(cn2, modus_ponens, x6, y6), and_1)
% 101.29/13.17 = { by lemma 58 R->L }
% 101.29/13.17 fresh19(fresh18(or_1, modus_ponens, x6, y6), and_1)
% 101.29/13.17 = { by axiom 1 (rosser_modus_ponens) }
% 101.29/13.17 fresh19(fresh18(or_1, true, x6, y6), and_1)
% 101.29/13.17 = { by axiom 22 (or_1_1) }
% 101.29/13.17 fresh19(is_a_theorem(implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.17 fresh19(fresh28(and_1, and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 36 R->L }
% 101.29/13.17 fresh19(fresh28(modus_ponens, and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 41 R->L }
% 101.29/13.17 fresh19(fresh28(fresh60(modus_ponens, modus_ponens, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by axiom 1 (rosser_modus_ponens) }
% 101.29/13.17 fresh19(fresh28(fresh60(modus_ponens, true, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by axiom 13 (modus_ponens_2) R->L }
% 101.29/13.17 fresh19(fresh28(fresh59(and_1, and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 62 R->L }
% 101.29/13.17 fresh19(fresh28(fresh59(fresh28(is_a_theorem(or(not(and(x6, not(or(x6, y6)))), not(or(x6, y6)))), and_1, implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.17 fresh19(fresh28(fresh59(fresh28(fresh28(and_1, and_1, or(not(and(x6, not(or(x6, y6)))), not(or(x6, y6)))), and_1, implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 44 R->L }
% 101.29/13.17 fresh19(fresh28(fresh59(fresh28(fresh28(fresh28(is_a_theorem(implies(not(or(x6, y6)), not(or(x6, y6)))), and_1, or(and(not(or(x6, y6)), x6), not(and(x6, not(or(x6, y6)))))), and_1, or(not(and(x6, not(or(x6, y6)))), not(or(x6, y6)))), and_1, implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.17 fresh19(fresh28(fresh59(fresh28(fresh28(fresh28(fresh28(and_1, and_1, implies(not(or(x6, y6)), not(or(x6, y6)))), and_1, or(and(not(or(x6, y6)), x6), not(and(x6, not(or(x6, y6)))))), and_1, or(not(and(x6, not(or(x6, y6)))), not(or(x6, y6)))), and_1, implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 54 R->L }
% 101.29/13.17 fresh19(fresh28(fresh59(fresh28(fresh28(fresh28(fresh28(is_a_theorem(equiv(not(or(x6, y6)), not(or(x6, y6)))), and_1, implies(not(or(x6, y6)), not(or(x6, y6)))), and_1, or(and(not(or(x6, y6)), x6), not(and(x6, not(or(x6, y6)))))), and_1, or(not(and(x6, not(or(x6, y6)))), not(or(x6, y6)))), and_1, implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 60 }
% 101.29/13.17 fresh19(fresh28(fresh59(fresh28(fresh28(fresh28(and_1, and_1, or(and(not(or(x6, y6)), x6), not(and(x6, not(or(x6, y6)))))), and_1, or(not(and(x6, not(or(x6, y6)))), not(or(x6, y6)))), and_1, implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by axiom 12 (modus_ponens_2) }
% 101.29/13.17 fresh19(fresh28(fresh59(fresh28(fresh28(is_a_theorem(or(and(not(or(x6, y6)), x6), not(and(x6, not(or(x6, y6)))))), and_1, or(not(and(x6, not(or(x6, y6)))), not(or(x6, y6)))), and_1, implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 51 }
% 101.29/13.17 fresh19(fresh28(fresh59(fresh28(and_1, and_1, implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by axiom 12 (modus_ponens_2) }
% 101.29/13.17 fresh19(fresh28(fresh59(is_a_theorem(implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), not(and(x6, not(or(x6, y6))))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 39 }
% 101.29/13.17 fresh19(fresh28(fresh59(is_a_theorem(implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))))), and_1, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 36 R->L }
% 101.29/13.17 fresh19(fresh28(fresh59(is_a_theorem(implies(or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))))), modus_ponens, or(or(x6, y6), implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 38 }
% 101.29/13.17 fresh19(fresh28(fresh28(is_a_theorem(or(or(x6, y6), implies(x6, or(x6, y6)))), modus_ponens, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 36 }
% 101.29/13.17 fresh19(fresh28(fresh28(is_a_theorem(or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by axiom 12 (modus_ponens_2) R->L }
% 101.29/13.17 fresh19(fresh28(fresh28(fresh28(and_1, and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 101.29/13.17 = { by lemma 36 R->L }
% 101.29/13.17 fresh19(fresh28(fresh28(fresh28(modus_ponens, and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 42 R->L }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh59(and_1, and_1, or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 36 R->L }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh59(and_1, modus_ponens, or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 62 R->L }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh59(fresh28(is_a_theorem(or(implies(not(x6), y6), not(x6))), and_1, implies(or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(not(x6), y6)))), modus_ponens, or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by axiom 12 (modus_ponens_2) R->L }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh59(fresh28(fresh28(and_1, and_1, or(implies(not(x6), y6), not(x6))), and_1, implies(or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(not(x6), y6)))), modus_ponens, or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 52 R->L }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh59(fresh28(fresh28(is_a_theorem(or(not(x6), implies(not(x6), y6))), and_1, or(implies(not(x6), y6), not(x6))), and_1, implies(or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(not(x6), y6)))), modus_ponens, or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 61 }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh59(fresh28(and_1, and_1, implies(or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(not(x6), y6)))), modus_ponens, or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by axiom 12 (modus_ponens_2) }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh59(is_a_theorem(implies(or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), implies(not(x6), y6)))), modus_ponens, or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 40 }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh59(is_a_theorem(implies(or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6)))), modus_ponens, or(x6, implies(x6, or(x6, y6))), or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 38 }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh28(is_a_theorem(or(x6, implies(x6, or(x6, y6)))), modus_ponens, or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 36 }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh28(is_a_theorem(or(x6, implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 52 }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(fresh28(and_1, and_1, or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by axiom 12 (modus_ponens_2) }
% 102.05/13.18 fresh19(fresh28(fresh28(fresh28(is_a_theorem(or(implies(x6, or(x6, y6)), or(x6, y6))), and_1, or(or(x6, y6), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 61 }
% 102.05/13.18 fresh19(fresh28(fresh28(and_1, and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by axiom 12 (modus_ponens_2) }
% 102.05/13.18 fresh19(fresh28(is_a_theorem(or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), and_1, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 36 R->L }
% 102.05/13.18 fresh19(fresh28(is_a_theorem(or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6)))), modus_ponens, implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 38 R->L }
% 102.05/13.18 fresh19(fresh59(is_a_theorem(implies(or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6)))), modus_ponens, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 55 }
% 102.05/13.18 fresh19(fresh59(fresh12(r1, modus_ponens, implies(x6, or(x6, y6))), modus_ponens, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 56 }
% 102.05/13.18 fresh19(fresh59(fresh47(cn3, modus_ponens, implies(x6, or(x6, y6))), modus_ponens, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 36 }
% 102.05/13.18 fresh19(fresh59(fresh47(cn3, modus_ponens, implies(x6, or(x6, y6))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 56 R->L }
% 102.05/13.18 fresh19(fresh59(fresh12(r1, modus_ponens, implies(x6, or(x6, y6))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 55 R->L }
% 102.05/13.18 fresh19(fresh59(is_a_theorem(implies(or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 40 R->L }
% 102.05/13.18 fresh19(fresh59(is_a_theorem(implies(implies(not(implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 46 R->L }
% 102.05/13.18 fresh19(fresh59(is_a_theorem(or(and(not(implies(x6, or(x6, y6))), not(implies(x6, or(x6, y6)))), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by axiom 12 (modus_ponens_2) R->L }
% 102.05/13.18 fresh19(fresh59(fresh28(and_1, and_1, or(and(not(implies(x6, or(x6, y6))), not(implies(x6, or(x6, y6)))), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 53 R->L }
% 102.05/13.18 fresh19(fresh59(fresh28(is_a_theorem(or(implies(x6, or(x6, y6)), and(not(implies(x6, or(x6, y6))), not(implies(x6, or(x6, y6)))))), and_1, or(and(not(implies(x6, or(x6, y6))), not(implies(x6, or(x6, y6)))), implies(x6, or(x6, y6)))), and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 61 }
% 102.05/13.18 fresh19(fresh59(and_1, and_1, or(implies(x6, or(x6, y6)), implies(x6, or(x6, y6))), implies(x6, or(x6, y6))), and_1)
% 102.05/13.18 = { by lemma 42 }
% 102.05/13.18 fresh19(modus_ponens, and_1)
% 102.05/13.18 = { by lemma 36 }
% 102.05/13.18 fresh19(and_1, and_1)
% 102.05/13.18 = { by axiom 9 (or_1) }
% 102.05/13.18 true
% 102.05/13.18 % SZS output end Proof
% 102.05/13.18
% 102.05/13.18 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------