---

Step * 1 of Lemma b-almost-full-filter


1. A : ℕ ⟶ ℕ ⟶ ℙ@i'
2. B : ℕ ⟶ ℕ ⟶ ℙ@i'
3. b-almost-full(n,m.A[n;m])@i
4. b-almost-full(n,m.B[n;m])@i
⊢ b-almost-full(n,m.A[n;m] ∧ B[n;m])
BY
{ (BLemma `intuitionistic-Ramsey` THEN Auto) }

---

Latex:

---

Latex:

1.  A  :  \mBbbN{}  {}\mrightarrow{}  \mBbbN{}  {}\mrightarrow{}  \mBbbP{}@i'
2.  B  :  \mBbbN{}  {}\mrightarrow{}  \mBbbN{}  {}\mrightarrow{}  \mBbbP{}@i'
3.  b-almost-full(n,m.A[n;m])@i
4.  b-almost-full(n,m.B[n;m])@i
\mvdash{}  b-almost-full(n,m.A[n;m]  \mwedge{}  B[n;m])


By

---

Latex:
(BLemma  `intuitionistic-Ramsey`  THEN  Auto)

---

Home Index