Proof net calculus introduced in Girard (1987) has been extended in the paradigm of Scott's domains equation D=D→D which generates a logical point of view for pure λ-calculus in Donos (1989). Methodologically speaking, in this paper the proof theoretic counterpart of Böhm's theorem given in Böhm (1968) for pure λ-calculus, is proposed as extension of the Curry-Howard paradigm. Technically speaking, as the extraction of a subterm using the β-reduction is possible also subnet extraction can be internalized by cut-elimination, using proof nets realizes managing and better understanding the procedure of extraction.
