Martin Escardo and Paulo Oliva 2011

\begin{code}

{-# OPTIONS --without-K #-}

module InfinitePigeon.K-AC-N where

open import InfinitePigeon.Choice
open import InfinitePigeon.JK-LogicalFacts
open import InfinitePigeon.JK-Monads
open import InfinitePigeon.K-Shift
open import InfinitePigeon.Logic
open import InfinitePigeon.LogicalFacts
open import InfinitePigeon.Naturals

\end{code}

-----------------------------------------------------------------------
-- The K-translation of countable choice AC-N can be proved only for --
-- certain formulas, including those that are in the image of the    --
-- K-translation.                                                    --
--                                                                   --
-- Hence we have a restriction efq (ex falso quadlibet).             --
--                                                                   --
-- This is because there is no general K-∀-shift.                    --
-----------------------------------------------------------------------

\begin{code}

K-AC-ℕ
 : {R : Ω} {X : ℕ → Set} {P : (n : ℕ) → X n → Ω}
 → (∀(n : ℕ) → R → ∃ \(m : X n) → P n m)               -- efqs,
 → (∀(n : ℕ) → K∃ \(m : X n) → P n m)                  -- premise,
 → K∃ \(f : ((n : ℕ) → X n)) → ∀(n : ℕ) → P n (f n)    -- conclusion.
K-AC-ℕ efqs = (K-functor AC) ∘ (K-∀-shift efqs)

\end{code}