Theorem nnssi2 33805

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 3965	. . . 4 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ 𝐷)
3	1	sseli 3965	. . . 4 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ 𝐷)
4		nnssi2.2	. . . 4 ⊢ (𝐵 ∈ ℕ → 𝜑)
5	2, 3, 4	3anim123i 1147	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝜑))
6	5	3anidm23 1417	. 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝜑))
7		nnssi2.3	. 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝜑) → 𝜓)
8	6, 7	syl 17	1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝜓)

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1083   ∈ wcel 2114   ⊆ wss 3938  ℕcn 11640

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-in 3945  df-ss 3954

This theorem is referenced by:  nndivsub  33807