Nuprl Lemma : rng-pp-nontrivial-4-ext
∀r:IntegDom{i}. ∀eq:EqDecider(|r|). ∀a:{p:ℕ3 ⟶ |r|| ¬(p = 0 ∈ (ℕ3 ⟶ |r|))} .
∃l,m,n:{p:ℕ3 ⟶ |r|| ¬(p = 0 ∈ (ℕ3 ⟶ |r|))}
((¬¬((a . l) = 0 ∈ |r|))
∧ (¬¬((a . m) = 0 ∈ |r|))
∧ (¬¬((a . n) = 0 ∈ |r|))
∧ (∃a:{p:ℕ3 ⟶ |r|| ¬(p = 0 ∈ (ℕ3 ⟶ |r|))} . ((¬¬((a . l) = 0 ∈ |r|)) ∧ (¬((a . m) = 0 ∈ |r|))))
∧ (∃a:{p:ℕ3 ⟶ |r|| ¬(p = 0 ∈ (ℕ3 ⟶ |r|))} . ((¬¬((a . m) = 0 ∈ |r|)) ∧ (¬((a . n) = 0 ∈ |r|))))
∧ (∃a:{p:ℕ3 ⟶ |r|| ¬(p = 0 ∈ (ℕ3 ⟶ |r|))} . ((¬¬((a . n) = 0 ∈ |r|)) ∧ (¬((a . l) = 0 ∈ |r|)))))
Proof
Definitions occuring in Statement :
deq: EqDecider(T),
int_seg: {i..j-},
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
not: ¬A,
and: P ∧ Q,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
natural_number: $n,
equal: s = t ∈ T,
integ_dom: IntegDom{i},
rng_zero: 0,
rng_car: |r|,
scalar-product: (a . b),
zero-vector: 0
Definitions unfolded in proof :
prop: ℙ,
has-value: (a)↓,
implies: P ⇒ Q,
all: ∀x:A. B[x],
so_apply: x[s],
so_lambda: λ2x.t[x],
uimplies: b supposing a,
so_apply: x[s1;s2],
top: Top,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2;s3;s4],
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
uall: ∀[x:A]. B[x],
rng-pp-nontrivial-1-ext,
iff_weakening_equal,
cross-product-non-zero-implies-ext,
any: any x,
deq-implies,
rng-pp-nontrivial-2,
rng-pp-nontrivial-4,
rng-pp-nontriv2: rng-pp-nontriv2(r;eq;p),
it: ⋅,
member: t ∈ T
Lemmas referenced :
is-exception_wf,
has-value_wf_base,
equal_wf,
top_wf,
lifting-strict-int_eq,
lifting-strict-callbyvalue,
strict4-spread,
lifting-strict-spread,
rng-pp-nontrivial-4,
rng-pp-nontrivial-1-ext,
iff_weakening_equal,
cross-product-non-zero-implies-ext,
deq-implies,
rng-pp-nontrivial-2
Rules used in proof :
closedConclusion,
baseApply,
exceptionSqequal,
axiomSqleEquality,
spreadExceptionCases,
independent_functionElimination,
dependent_functionElimination,
hypothesisEquality,
sqleReflexivity,
productElimination,
productEquality,
callbyvalueSpread,
divergentSqle,
sqequalSqle,
lambdaFormation,
independent_isectElimination,
voidEquality,
voidElimination,
isect_memberEquality,
baseClosed,
isectElimination,
equalitySymmetry,
equalityTransitivity,
sqequalHypSubstitution,
thin,
sqequalRule,
hypothesis,
extract_by_obid,
instantiate,
cut,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution,
introduction
Latex:
\mforall{}r:IntegDom\{i\}. \mforall{}eq:EqDecider(|r|). \mforall{}a:\{p:\mBbbN{}3 {}\mrightarrow{} |r|| \mneg{}(p = 0)\} .
\mexists{}l,m,n:\{p:\mBbbN{}3 {}\mrightarrow{} |r|| \mneg{}(p = 0)\}
((\mneg{}\mneg{}((a . l) = 0))
\mwedge{} (\mneg{}\mneg{}((a . m) = 0))
\mwedge{} (\mneg{}\mneg{}((a . n) = 0))
\mwedge{} (\mexists{}a:\{p:\mBbbN{}3 {}\mrightarrow{} |r|| \mneg{}(p = 0)\} . ((\mneg{}\mneg{}((a . l) = 0)) \mwedge{} (\mneg{}((a . m) = 0))))
\mwedge{} (\mexists{}a:\{p:\mBbbN{}3 {}\mrightarrow{} |r|| \mneg{}(p = 0)\} . ((\mneg{}\mneg{}((a . m) = 0)) \mwedge{} (\mneg{}((a . n) = 0))))
\mwedge{} (\mexists{}a:\{p:\mBbbN{}3 {}\mrightarrow{} |r|| \mneg{}(p = 0)\} . ((\mneg{}\mneg{}((a . n) = 0)) \mwedge{} (\mneg{}((a . l) = 0)))))
Date html generated:
2018_05_22-PM-00_55_01
Last ObjectModification:
2018_05_21-AM-01_26_19
Theory : euclidean!plane!geometry
Home
Index