1 include "logic/equality.ma".
3 (* Inclusion of: RNG028-8.p *)
5 (* -------------------------------------------------------------------------- *)
7 (* File : RNG028-8 : TPTP v3.7.0. Released v1.0.0. *)
9 (* Domain : Ring Theory (Alternative) *)
11 (* Problem : Left Moufang identity *)
13 (* Version : [Ste87] (equality) axioms. *)
15 (* Theorem formulation : Associators. *)
19 (* Refs : [Ste87] Stevens (1987), Some Experiments in Nonassociative Rin *)
21 (* : [Ste88] Stevens (1988), Challenge Problems from Nonassociative *)
23 (* Source : [Ste87] *)
25 (* Names : m2' [Ste87] *)
27 (* Status : Unsatisfiable *)
29 (* Rating : 0.78 v3.4.0, 0.75 v3.3.0, 0.86 v3.1.0, 0.89 v2.7.0, 0.91 v2.6.0, 0.83 v2.5.0, 0.75 v2.4.0, 0.67 v2.2.1, 1.00 v2.0.0 *)
31 (* Syntax : Number of clauses : 16 ( 0 non-Horn; 16 unit; 1 RR) *)
33 (* Number of atoms : 16 ( 16 equality) *)
35 (* Maximal clause size : 1 ( 1 average) *)
37 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
39 (* Number of functors : 9 ( 4 constant; 0-3 arity) *)
41 (* Number of variables : 27 ( 2 singleton) *)
43 (* Maximal term depth : 5 ( 2 average) *)
45 (* Comments : [Ste88] presents a slightly different set of axioms for proving *)
47 (* this ntheorem. The axioms are so similar to those in RNG004.ax *)
49 (* that a separate problems has not been created. *)
51 (* -------------------------------------------------------------------------- *)
53 (* ----Include nonassociative ring axioms *)
55 (* Inclusion of: Axioms/RNG003-0.ax *)
57 (* -------------------------------------------------------------------------- *)
59 (* File : RNG003-0 : TPTP v3.7.0. Released v1.0.0. *)
61 (* Domain : Ring Theory (Alternative) *)
63 (* Axioms : Alternative ring theory (equality) axioms *)
65 (* Version : [Ste87] (equality) axioms. *)
69 (* Refs : [Ste87] Stevens (1987), Some Experiments in Nonassociative Rin *)
71 (* Source : [Ste87] *)
77 (* Syntax : Number of clauses : 15 ( 0 non-Horn; 15 unit; 0 RR) *)
79 (* Number of atoms : 15 ( 15 equality) *)
81 (* Maximal clause size : 1 ( 1 average) *)
83 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
85 (* Number of functors : 6 ( 1 constant; 0-3 arity) *)
87 (* Number of variables : 27 ( 2 singleton) *)
89 (* Maximal term depth : 5 ( 2 average) *)
93 (* -------------------------------------------------------------------------- *)
95 (* ----There exists an additive identity element *)
97 (* ----Multiplicative zero *)
99 (* ----Existence of left additive additive_inverse *)
101 (* ----Inverse of additive_inverse of X is X *)
103 (* ----Distributive property of product over sum *)
105 (* ----Commutativity for addition *)
107 (* ----Associativity for addition *)
109 (* ----Right alternative law *)
111 (* ----Left alternative law *)
117 (* -------------------------------------------------------------------------- *)
119 (* -------------------------------------------------------------------------- *)
120 ntheorem prove_left_moufang:
121 (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
122 ∀add:∀_:Univ.∀_:Univ.Univ.
123 ∀additive_identity:Univ.
124 ∀additive_inverse:∀_:Univ.Univ.
125 ∀associator:∀_:Univ.∀_:Univ.∀_:Univ.Univ.
126 ∀commutator:∀_:Univ.∀_:Univ.Univ.
127 ∀multiply:∀_:Univ.∀_:Univ.Univ.
131 ∀H0:∀X:Univ.∀Y:Univ.eq Univ (commutator X Y) (add (multiply Y X) (additive_inverse (multiply X Y))).
132 ∀H1:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (associator X Y Z) (add (multiply (multiply X Y) Z) (additive_inverse (multiply X (multiply Y Z)))).
133 ∀H2:∀X:Univ.∀Y:Univ.eq Univ (multiply (multiply X X) Y) (multiply X (multiply X Y)).
134 ∀H3:∀X:Univ.∀Y:Univ.eq Univ (multiply (multiply X Y) Y) (multiply X (multiply Y Y)).
135 ∀H4:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (add X (add Y Z)) (add (add X Y) Z).
136 ∀H5:∀X:Univ.∀Y:Univ.eq Univ (add X Y) (add Y X).
137 ∀H6:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply (add X Y) Z) (add (multiply X Z) (multiply Y Z)).
138 ∀H7:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (multiply X (add Y Z)) (add (multiply X Y) (multiply X Z)).
139 ∀H8:∀X:Univ.eq Univ (additive_inverse (additive_inverse X)) X.
140 ∀H9:∀X:Univ.eq Univ (add X (additive_inverse X)) additive_identity.
141 ∀H10:∀X:Univ.eq Univ (add (additive_inverse X) X) additive_identity.
142 ∀H11:∀X:Univ.eq Univ (multiply X additive_identity) additive_identity.
143 ∀H12:∀X:Univ.eq Univ (multiply additive_identity X) additive_identity.
144 ∀H13:∀X:Univ.eq Univ (add X additive_identity) X.
145 ∀H14:∀X:Univ.eq Univ (add additive_identity X) X.eq Univ (associator x (multiply y x) z) (multiply x (associator x y z)))
152 #additive_identity ##.
153 #additive_inverse ##.
175 nauto by H0,H1,H2,H3,H4,H5,H6,H7,H8,H9,H10,H11,H12,H13,H14 ##;
176 ntry (nassumption) ##;
179 (* -------------------------------------------------------------------------- *)