Step * 2 of Lemma satisfies-and-poly-constraints


1. : ℤ ⟶ ℤ
2. L2 polynomial-constraints() List
3. L1 polynomial-constraints() List
4. polynomial-constraints()
5. polynomial-constraints()
6. (A ∈ L1)
7. polynomial-constraints()
8. (B ∈ L2)
9. combine-pcs(A;B) ∈ polynomial-constraints()
10. satisfies-poly-constraints(f;X)
⊢ ∃X:polynomial-constraints(). ((X ∈ L1) ∧ satisfies-poly-constraints(f;X))
BY
(With ⌜A⌝ (D 0)⋅ THEN Auto) }

1
1. : ℤ ⟶ ℤ
2. L2 polynomial-constraints() List
3. L1 polynomial-constraints() List
4. polynomial-constraints()
5. polynomial-constraints()
6. (A ∈ L1)
7. polynomial-constraints()
8. (B ∈ L2)
9. combine-pcs(A;B) ∈ polynomial-constraints()
10. satisfies-poly-constraints(f;X)
11. (A ∈ L1)
⊢ satisfies-poly-constraints(f;A)


Latex:


Latex:

1.  f  :  \mBbbZ{}  {}\mrightarrow{}  \mBbbZ{}
2.  L2  :  polynomial-constraints()  List
3.  L1  :  polynomial-constraints()  List
4.  X  :  polynomial-constraints()
5.  A  :  polynomial-constraints()
6.  (A  \mmember{}  L1)
7.  B  :  polynomial-constraints()
8.  (B  \mmember{}  L2)
9.  X  =  combine-pcs(A;B)
10.  satisfies-poly-constraints(f;X)
\mvdash{}  \mexists{}X:polynomial-constraints().  ((X  \mmember{}  L1)  \mwedge{}  satisfies-poly-constraints(f;X))


By


Latex:
(With  \mkleeneopen{}A\mkleeneclose{}  (D  0)\mcdot{}  THEN  Auto)




Home Index