Theorem nnssi3 33797

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

Hypotheses

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

Assertion

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

Proof of Theorem nnssi3

Step	Hyp	Ref	Expression
1		nnssi3.1	. . . 4 ⊢ ℕ ⊆ 𝐷
2	1	sseli 3961	. . 3 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ 𝐷)
3	1	sseli 3961	. . 3 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ 𝐷)
4	1	sseli 3961	. . 3 ⊢ (𝐶 ∈ ℕ → 𝐶 ∈ 𝐷)
5	2, 3, 4	3anim123i 1146	. 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷))
6		nnssi3.2	. . 3 ⊢ (𝐶 ∈ ℕ → 𝜑)
7	6	3ad2ant3 1130	. 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝜑)
8		nnssi3.3	. 2 ⊢ (((𝐴 ∈ 𝐷 ∧ 𝐵 ∈ 𝐷 ∧ 𝐶 ∈ 𝐷) ∧ 𝜑) → 𝜓)
9	5, 7, 8	syl2anc 586	1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝜓)

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1082   ∈ wcel 2108   ⊆ wss 3934  ℕcn 11630

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-clab 2798  df-cleq 2812  df-clel 2891  df-in 3941  df-ss 3950

This theorem is referenced by: (None)