cpnord - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cpnord		Structured version Visualization version GIF version

Theorem cpnord 25898

Description: 𝓑C^𝑛 conditions are ordered by strength. (Contributed by Stefan O'Rear, 16-Nov-2014.) (Revised by Mario Carneiro, 11-Feb-2015.)

**Assertion**
Ref	Expression
cpnord	⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) → ((𝓑C^𝑛‘𝑆)‘𝑁) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀))

Proof of Theorem cpnord Dummy variables 𝑓 𝑛 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6835	. . . . . 6 ⊢ (𝑛 = 𝑀 → ((𝓑C^𝑛‘𝑆)‘𝑛) = ((𝓑C^𝑛‘𝑆)‘𝑀))
2	1	sseq1d 3966	. . . . 5 ⊢ (𝑛 = 𝑀 → (((𝓑C^𝑛‘𝑆)‘𝑛) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀) ↔ ((𝓑C^𝑛‘𝑆)‘𝑀) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
3	2	imbi2d 340	. . . 4 ⊢ (𝑛 = 𝑀 → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑛) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)) ↔ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑀) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀))))
4		fveq2 6835	. . . . . 6 ⊢ (𝑛 = 𝑚 → ((𝓑C^𝑛‘𝑆)‘𝑛) = ((𝓑C^𝑛‘𝑆)‘𝑚))
5	4	sseq1d 3966	. . . . 5 ⊢ (𝑛 = 𝑚 → (((𝓑C^𝑛‘𝑆)‘𝑛) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀) ↔ ((𝓑C^𝑛‘𝑆)‘𝑚) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
6	5	imbi2d 340	. . . 4 ⊢ (𝑛 = 𝑚 → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑛) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)) ↔ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑚) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀))))
7		fveq2 6835	. . . . . 6 ⊢ (𝑛 = (𝑚 + 1) → ((𝓑C^𝑛‘𝑆)‘𝑛) = ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)))
8	7	sseq1d 3966	. . . . 5 ⊢ (𝑛 = (𝑚 + 1) → (((𝓑C^𝑛‘𝑆)‘𝑛) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀) ↔ ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
9	8	imbi2d 340	. . . 4 ⊢ (𝑛 = (𝑚 + 1) → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑛) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)) ↔ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀))))
10		fveq2 6835	. . . . . 6 ⊢ (𝑛 = 𝑁 → ((𝓑C^𝑛‘𝑆)‘𝑛) = ((𝓑C^𝑛‘𝑆)‘𝑁))
11	10	sseq1d 3966	. . . . 5 ⊢ (𝑛 = 𝑁 → (((𝓑C^𝑛‘𝑆)‘𝑛) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀) ↔ ((𝓑C^𝑛‘𝑆)‘𝑁) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
12	11	imbi2d 340	. . . 4 ⊢ (𝑛 = 𝑁 → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑛) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)) ↔ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑁) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀))))
13		ssid 3957	. . . . 5 ⊢ ((𝓑C^𝑛‘𝑆)‘𝑀) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)
14	13	2a1i 12	. . . 4 ⊢ (𝑀 ∈ ℤ → ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑀) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
15		simprl 771	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → 𝑓 ∈ (ℂ ↑_pm 𝑆))
16		recnprss 25866	. . . . . . . . . . . . . 14 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
17	16	ad2antrr 727	. . . . . . . . . . . . 13 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → 𝑆 ⊆ ℂ)
18	17	adantr 480	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → 𝑆 ⊆ ℂ)
19		simplll 775	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → 𝑆 ∈ {ℝ, ℂ})
20		eluznn0 12835	. . . . . . . . . . . . . . . 16 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → 𝑚 ∈ ℕ₀)
21	20	adantll 715	. . . . . . . . . . . . . . 15 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → 𝑚 ∈ ℕ₀)
22	21	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → 𝑚 ∈ ℕ₀)
23		dvnf 25890	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑚 ∈ ℕ₀) → ((𝑆 D^𝑛 𝑓)‘𝑚):dom ((𝑆 D^𝑛 𝑓)‘𝑚)⟶ℂ)
24	19, 15, 22, 23	syl3anc 1374	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → ((𝑆 D^𝑛 𝑓)‘𝑚):dom ((𝑆 D^𝑛 𝑓)‘𝑚)⟶ℂ)
25		dvnbss 25891	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑚 ∈ ℕ₀) → dom ((𝑆 D^𝑛 𝑓)‘𝑚) ⊆ dom 𝑓)
26	19, 15, 22, 25	syl3anc 1374	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → dom ((𝑆 D^𝑛 𝑓)‘𝑚) ⊆ dom 𝑓)
27		dvnp1 25888	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ 𝑚 ∈ ℕ₀) → ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) = (𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)))
28	18, 15, 22, 27	syl3anc 1374	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) = (𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)))
29		simprr 773	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))
30	28, 29	eqeltrrd 2838	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → (𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)) ∈ (dom 𝑓–cn→ℂ))
31		cncff 24847	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)) ∈ (dom 𝑓–cn→ℂ) → (𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)):dom 𝑓⟶ℂ)
32	30, 31	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → (𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)):dom 𝑓⟶ℂ)
33	32	fdmd 6673	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → dom (𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)) = dom 𝑓)
34		cnex 11112	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ℂ ∈ V
35		elpm2g 8786	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((ℂ ∈ V ∧ 𝑆 ∈ {ℝ, ℂ}) → (𝑓 ∈ (ℂ ↑_pm 𝑆) ↔ (𝑓:dom 𝑓⟶ℂ ∧ dom 𝑓 ⊆ 𝑆)))
36	34, 19, 35	sylancr 588	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → (𝑓 ∈ (ℂ ↑_pm 𝑆) ↔ (𝑓:dom 𝑓⟶ℂ ∧ dom 𝑓 ⊆ 𝑆)))
37	15, 36	mpbid 232	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → (𝑓:dom 𝑓⟶ℂ ∧ dom 𝑓 ⊆ 𝑆))
38	37	simprd 495	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → dom 𝑓 ⊆ 𝑆)
39	26, 38	sstrd 3945	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → dom ((𝑆 D^𝑛 𝑓)‘𝑚) ⊆ 𝑆)
40	18, 24, 39	dvbss 25863	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → dom (𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)) ⊆ dom ((𝑆 D^𝑛 𝑓)‘𝑚))
41	33, 40	eqsstrrd 3970	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → dom 𝑓 ⊆ dom ((𝑆 D^𝑛 𝑓)‘𝑚))
42	26, 41	eqssd 3952	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → dom ((𝑆 D^𝑛 𝑓)‘𝑚) = dom 𝑓)
43	42	feq2d 6647	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → (((𝑆 D^𝑛 𝑓)‘𝑚):dom ((𝑆 D^𝑛 𝑓)‘𝑚)⟶ℂ ↔ ((𝑆 D^𝑛 𝑓)‘𝑚):dom 𝑓⟶ℂ))
44	24, 43	mpbid 232	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → ((𝑆 D^𝑛 𝑓)‘𝑚):dom 𝑓⟶ℂ)
45		dvcn 25884	. . . . . . . . . . . 12 ⊢ (((𝑆 ⊆ ℂ ∧ ((𝑆 D^𝑛 𝑓)‘𝑚):dom 𝑓⟶ℂ ∧ dom 𝑓 ⊆ 𝑆) ∧ dom (𝑆 D ((𝑆 D^𝑛 𝑓)‘𝑚)) = dom 𝑓) → ((𝑆 D^𝑛 𝑓)‘𝑚) ∈ (dom 𝑓–cn→ℂ))
46	18, 44, 38, 33, 45	syl31anc 1376	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → ((𝑆 D^𝑛 𝑓)‘𝑚) ∈ (dom 𝑓–cn→ℂ))
47	15, 46	jca 511	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) ∧ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))) → (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘𝑚) ∈ (dom 𝑓–cn→ℂ)))
48	47	ex 412	. . . . . . . . 9 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → ((𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ)) → (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘𝑚) ∈ (dom 𝑓–cn→ℂ))))
49		peano2nn0 12446	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℕ₀ → (𝑚 + 1) ∈ ℕ₀)
50	21, 49	syl 17	. . . . . . . . . 10 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → (𝑚 + 1) ∈ ℕ₀)
51		elcpn 25897	. . . . . . . . . 10 ⊢ ((𝑆 ⊆ ℂ ∧ (𝑚 + 1) ∈ ℕ₀) → (𝑓 ∈ ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ↔ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))))
52	17, 50, 51	syl2anc 585	. . . . . . . . 9 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → (𝑓 ∈ ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ↔ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘(𝑚 + 1)) ∈ (dom 𝑓–cn→ℂ))))
53		elcpn 25897	. . . . . . . . . 10 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑚 ∈ ℕ₀) → (𝑓 ∈ ((𝓑C^𝑛‘𝑆)‘𝑚) ↔ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘𝑚) ∈ (dom 𝑓–cn→ℂ))))
54	17, 21, 53	syl2anc 585	. . . . . . . . 9 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → (𝑓 ∈ ((𝓑C^𝑛‘𝑆)‘𝑚) ↔ (𝑓 ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 𝑓)‘𝑚) ∈ (dom 𝑓–cn→ℂ))))
55	48, 52, 54	3imtr4d 294	. . . . . . . 8 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → (𝑓 ∈ ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) → 𝑓 ∈ ((𝓑C^𝑛‘𝑆)‘𝑚)))
56	55	ssrdv 3940	. . . . . . 7 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑚))
57		sstr2 3941	. . . . . . 7 ⊢ (((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑚) → (((𝓑C^𝑛‘𝑆)‘𝑚) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀) → ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
58	56, 57	syl 17	. . . . . 6 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) ∧ 𝑚 ∈ (ℤ_≥‘𝑀)) → (((𝓑C^𝑛‘𝑆)‘𝑚) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀) → ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
59	58	expcom 413	. . . . 5 ⊢ (𝑚 ∈ (ℤ_≥‘𝑀) → ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → (((𝓑C^𝑛‘𝑆)‘𝑚) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀) → ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀))))
60	59	a2d 29	. . . 4 ⊢ (𝑚 ∈ (ℤ_≥‘𝑀) → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑚) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)) → ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘(𝑚 + 1)) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀))))
61	3, 6, 9, 12, 14, 60	uzind4 12824	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → ((𝓑C^𝑛‘𝑆)‘𝑁) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
62	61	com12 32	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀) → (𝑁 ∈ (ℤ_≥‘𝑀) → ((𝓑C^𝑛‘𝑆)‘𝑁) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀)))
63	62	3impia 1118	1 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) → ((𝓑C^𝑛‘𝑆)‘𝑁) ⊆ ((𝓑C^𝑛‘𝑆)‘𝑀))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 Vcvv 3441 ⊆ wss 3902 {cpr 4583 dom cdm 5625 ⟶wf 6489 ‘cfv 6493 (class class class)co 7361 ↑_pm cpm 8769 ℂcc 11029 ℝcr 11030 1c1 11032 + caddc 11034 ℕ₀cn0 12406 ℤcz 12493 ℤ_≥cuz 12756 –cn→ccncf 24830 D cdv 25825 D^𝑛 cdvn 25826 𝓑C^𝑛ccpn 25827

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7683 ax-inf2 9555 ax-cnex 11087 ax-resscn 11088 ax-1cn 11089 ax-icn 11090 ax-addcl 11091 ax-addrcl 11092 ax-mulcl 11093 ax-mulrcl 11094 ax-mulcom 11095 ax-addass 11096 ax-mulass 11097 ax-distr 11098 ax-i2m1 11099 ax-1ne0 11100 ax-1rid 11101 ax-rnegex 11102 ax-rrecex 11103 ax-cnre 11104 ax-pre-lttri 11105 ax-pre-lttrn 11106 ax-pre-ltadd 11107 ax-pre-mulgt0 11108 ax-pre-sup 11109 ax-addf 11110

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-iin 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-of 7625 df-om 7812 df-1st 7936 df-2nd 7937 df-supp 8106 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-2o 8401 df-er 8638 df-map 8770 df-pm 8771 df-ixp 8841 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-fsupp 9270 df-fi 9319 df-sup 9350 df-inf 9351 df-oi 9420 df-card 9856 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-div 11800 df-nn 12151 df-2 12213 df-3 12214 df-4 12215 df-5 12216 df-6 12217 df-7 12218 df-8 12219 df-9 12220 df-n0 12407 df-z 12494 df-dec 12613 df-uz 12757 df-q 12867 df-rp 12911 df-xneg 13031 df-xadd 13032 df-xmul 13033 df-icc 13273 df-fz 13429 df-fzo 13576 df-seq 13930 df-exp 13990 df-hash 14259 df-cj 15027 df-re 15028 df-im 15029 df-sqrt 15163 df-abs 15164 df-struct 17079 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17142 df-ress 17163 df-plusg 17195 df-mulr 17196 df-starv 17197 df-sca 17198 df-vsca 17199 df-ip 17200 df-tset 17201 df-ple 17202 df-ds 17204 df-unif 17205 df-hom 17206 df-cco 17207 df-rest 17347 df-topn 17348 df-0g 17366 df-gsum 17367 df-topgen 17368 df-pt 17369 df-prds 17372 df-xrs 17428 df-qtop 17433 df-imas 17434 df-xps 17436 df-mre 17510 df-mrc 17511 df-acs 17513 df-mgm 18570 df-sgrp 18649 df-mnd 18665 df-submnd 18714 df-mulg 19003 df-cntz 19251 df-cmn 19716 df-psmet 21306 df-xmet 21307 df-met 21308 df-bl 21309 df-mopn 21310 df-fbas 21311 df-fg 21312 df-cnfld 21315 df-top 22843 df-topon 22860 df-topsp 22882 df-bases 22895 df-cld 22968 df-ntr 22969 df-cls 22970 df-nei 23047 df-lp 23085 df-perf 23086 df-cn 23176 df-cnp 23177 df-haus 23264 df-tx 23511 df-hmeo 23704 df-fil 23795 df-fm 23887 df-flim 23888 df-flf 23889 df-xms 24269 df-ms 24270 df-tms 24271 df-cncf 24832 df-limc 25828 df-dv 25829 df-dvn 25830 df-cpn 25831

This theorem is referenced by: cpncn 25899 c1lip2 25964

W3C validator