---

Step * 1 1 1 1 of Lemma reducible-nat


1. n : ℤ@i
2. 2 ≤ n
3. b : ℤ-o@i
4. c : ℤ-o@i
5. ¬(b ~ 1)@i
6. ¬(c ~ 1)@i
7. n = (b * c) ∈ ℤ@i
8. 2 ≤ b
9. 2 ≤ c
⊢ b < n
BY
{ (SupposeNot
   THEN (InstLemma `mul_preserves_le` [⌜n⌝;⌜b⌝;⌜c⌝]⋅ THEN Auto)
   THEN InstLemma `mul_preserves_le` [⌜2⌝;⌜c⌝;⌜n⌝]⋅
   THEN Auto') }

---

Latex:

---

Latex:

1.  n  :  \mBbbZ{}@i
2.  2  \mleq{}  n
3.  b  :  \mBbbZ{}\msupminus{}\msupzero{}@i
4.  c  :  \mBbbZ{}\msupminus{}\msupzero{}@i
5.  \mneg{}(b  \msim{}  1)@i
6.  \mneg{}(c  \msim{}  1)@i
7.  n  =  (b  *  c)@i
8.  2  \mleq{}  b
9.  2  \mleq{}  c
\mvdash{}  b  <  n


By

---

Latex:
(SupposeNot
  THEN  (InstLemma  `mul\_preserves\_le`  [\mkleeneopen{}n\mkleeneclose{};\mkleeneopen{}b\mkleeneclose{};\mkleeneopen{}c\mkleeneclose{}]\mcdot{}  THEN  Auto)
  THEN  InstLemma  `mul\_preserves\_le`  [\mkleeneopen{}2\mkleeneclose{};\mkleeneopen{}c\mkleeneclose{};\mkleeneopen{}n\mkleeneclose{}]\mcdot{}
  THEN  Auto')

---

Home Index