---

Step * 4 of Lemma b-almost-full-intersection

.....antecedent..... 
1. R : ℕ ⟶ ℕ ⟶ ℙ
2. T : ℕ ⟶ ℕ ⟶ ℙ
3. b-almost-full(n,m.R[n;m])
4. b-almost-full(n,m.T[n;m])
⊢ ∀alpha:StrictInc. ⇃(∃m:ℕ. baf-bar(n,m.R[n;m];n,m.T[n;m];m;alpha))
BY
{ TACTIC:(Auto THEN (InstLemma  `b-almost-full-intersection-lemma` [⌜R⌝;⌜T⌝;⌜alpha⌝]⋅ THENA Auto)) }

1
1. R : ℕ ⟶ ℕ ⟶ ℙ
2. T : ℕ ⟶ ℕ ⟶ ℙ
3. b-almost-full(n,m.R[n;m])
4. b-almost-full(n,m.T[n;m])
5. alpha : StrictInc
6. ⇃(∃m:ℕ. ∃n,p:{m + 1...}. (R[alpha m;alpha n] ∧ T[alpha m;alpha p]))
⊢ ⇃(∃m:ℕ. baf-bar(n,m.R[n;m];n,m.T[n;m];m;alpha))

---

Latex:

---

Latex:
.....antecedent..... 
1.  R  :  \mBbbN{}  {}\mrightarrow{}  \mBbbN{}  {}\mrightarrow{}  \mBbbP{}
2.  T  :  \mBbbN{}  {}\mrightarrow{}  \mBbbN{}  {}\mrightarrow{}  \mBbbP{}
3.  b-almost-full(n,m.R[n;m])
4.  b-almost-full(n,m.T[n;m])
\mvdash{}  \mforall{}alpha:StrictInc.  \00D9(\mexists{}m:\mBbbN{}.  baf-bar(n,m.R[n;m];n,m.T[n;m];m;alpha))


By

---

Latex:
TACTIC:(Auto  THEN  (InstLemma    `b-almost-full-intersection-lemma`  [\mkleeneopen{}R\mkleeneclose{};\mkleeneopen{}T\mkleeneclose{};\mkleeneopen{}alpha\mkleeneclose{}]\mcdot{}  THENA  Auto))

---

Home Index