Theorem nnssi2 36683

Description: Convert a theorem for real/complex numbers into one for positive integers. (Contributed by Jeff Hoffman, 17-Jun-2008.)

Hypotheses

Ref	Expression
nnssi2.1	⊢ ℕ ⊆ 𝐷
nnssi2.2	⊢ (𝐵 ∈ ℕ → 𝜑)
nnssi2.3	⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝜑) → 𝜓)

Assertion

Ref	Expression
nnssi2	⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝜓)

Proof of Theorem nnssi2

Step	Hyp	Ref	Expression
1		nnssi2.1	. . . . 5 ⊢ ℕ ⊆ 𝐷
2	1	sseli 3911	. . . 4 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ 𝐷)
3	1	sseli 3911	. . . 4 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ 𝐷)
4		nnssi2.2	. . . 4 ⊢ (𝐵 ∈ ℕ → 𝜑)
5	2, 3, 4	3anim123i 1157	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝜑))
6	5	3anidm23 1429	. 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝜑))
7		nnssi2.3	. 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝜑) → 𝜓)
8	6, 7	syl 17	1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝜓)

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1092   ∈ wcel 2119   ⊆ wss 3883  ℕcn 12165

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121

This theorem depends on definitions:  df-bi 208  df-an 397  df-3an 1094  df-ex 1787  df-clel 2814  df-ss 3900

This theorem is referenced by:  nndivsub  36685