vdwlem2 - Metamath Proof Explorer

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

Theorem vdwlem2 16611

Description: Lemma for vdw 16623. (Contributed by Mario Carneiro, 12-Sep-2014.)

**Hypotheses**
Ref	Expression
vdwlem2.r	⊢ (𝜑 → 𝑅 ∈ Fin)
vdwlem2.k	⊢ (𝜑 → 𝐾 ∈ ℕ₀)
vdwlem2.w	⊢ (𝜑 → 𝑊 ∈ ℕ)
vdwlem2.n	⊢ (𝜑 → 𝑁 ∈ ℕ)
vdwlem2.f	⊢ (𝜑 → 𝐹:(1...𝑀)⟶𝑅)
vdwlem2.m	⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘(𝑊 + 𝑁)))
vdwlem2.g	⊢ 𝐺 = (𝑥 ∈ (1...𝑊) ↦ (𝐹‘(𝑥 + 𝑁)))

**Assertion**
Ref	Expression
vdwlem2	⊢ (𝜑 → (𝐾 MonoAP 𝐺 → 𝐾 MonoAP 𝐹))

Distinct variable groups: 𝑥,𝐹 𝑥,𝐾 𝑥,𝑀 𝜑,𝑥 𝑥,𝐺 𝑥,𝑁 𝑥,𝑅 𝑥,𝑊

Proof of Theorem vdwlem2 Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 22	. . . . . 6 ⊢ (𝑎 ∈ ℕ → 𝑎 ∈ ℕ)
2		vdwlem2.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ)
3		nnaddcl 11926	. . . . . 6 ⊢ ((𝑎 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑎 + 𝑁) ∈ ℕ)
4	1, 2, 3	syl2anr 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℕ) → (𝑎 + 𝑁) ∈ ℕ)
5		simpllr 772	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑎 ∈ ℕ)
6	5	nncnd 11919	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑎 ∈ ℂ)
7	2	ad3antrrr 726	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑁 ∈ ℕ)
8	7	nncnd 11919	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑁 ∈ ℂ)
9		elfznn0 13278	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 ∈ (0...(𝐾 − 1)) → 𝑚 ∈ ℕ₀)
10	9	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑚 ∈ ℕ₀)
11	10	nn0cnd 12225	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑚 ∈ ℂ)
12		simplrl 773	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑑 ∈ ℕ)
13	12	nncnd 11919	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝑑 ∈ ℂ)
14	11, 13	mulcld 10926	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝑚 · 𝑑) ∈ ℂ)
15	6, 8, 14	add32d 11132	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → ((𝑎 + 𝑁) + (𝑚 · 𝑑)) = ((𝑎 + (𝑚 · 𝑑)) + 𝑁))
16		oveq1 7262	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (𝑎 + (𝑚 · 𝑑)) → (𝑥 + 𝑁) = ((𝑎 + (𝑚 · 𝑑)) + 𝑁))
17	16	eleq1d 2823	. . . . . . . . . . . . . 14 ⊢ (𝑥 = (𝑎 + (𝑚 · 𝑑)) → ((𝑥 + 𝑁) ∈ (1...𝑀) ↔ ((𝑎 + (𝑚 · 𝑑)) + 𝑁) ∈ (1...𝑀)))
18		elfznn 13214	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ (1...𝑊) → 𝑥 ∈ ℕ)
19		nnaddcl 11926	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (𝑥 + 𝑁) ∈ ℕ)
20	18, 2, 19	syl2anr 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...𝑊)) → (𝑥 + 𝑁) ∈ ℕ)
21		nnuz 12550	. . . . . . . . . . . . . . . . . 18 ⊢ ℕ = (ℤ_≥‘1)
22	20, 21	eleqtrdi 2849	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...𝑊)) → (𝑥 + 𝑁) ∈ (ℤ_≥‘1))
23		vdwlem2.m	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘(𝑊 + 𝑁)))
24		elfzuz3 13182	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ (1...𝑊) → 𝑊 ∈ (ℤ_≥‘𝑥))
25	2	nnzd 12354	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑁 ∈ ℤ)
26		eluzadd 12542	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑊 ∈ (ℤ_≥‘𝑥) ∧ 𝑁 ∈ ℤ) → (𝑊 + 𝑁) ∈ (ℤ_≥‘(𝑥 + 𝑁)))
27	24, 25, 26	syl2anr 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...𝑊)) → (𝑊 + 𝑁) ∈ (ℤ_≥‘(𝑥 + 𝑁)))
28		uztrn 12529	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑀 ∈ (ℤ_≥‘(𝑊 + 𝑁)) ∧ (𝑊 + 𝑁) ∈ (ℤ_≥‘(𝑥 + 𝑁))) → 𝑀 ∈ (ℤ_≥‘(𝑥 + 𝑁)))
29	23, 27, 28	syl2an2r 681	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...𝑊)) → 𝑀 ∈ (ℤ_≥‘(𝑥 + 𝑁)))
30		elfzuzb 13179	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 + 𝑁) ∈ (1...𝑀) ↔ ((𝑥 + 𝑁) ∈ (ℤ_≥‘1) ∧ 𝑀 ∈ (ℤ_≥‘(𝑥 + 𝑁))))
31	22, 29, 30	sylanbrc 582	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...𝑊)) → (𝑥 + 𝑁) ∈ (1...𝑀))
32	31	ralrimiva 3107	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∀𝑥 ∈ (1...𝑊)(𝑥 + 𝑁) ∈ (1...𝑀))
33	32	ad3antrrr 726	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → ∀𝑥 ∈ (1...𝑊)(𝑥 + 𝑁) ∈ (1...𝑀))
34		simplrr 774	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))
35		eqid 2738	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 + (𝑚 · 𝑑)) = (𝑎 + (𝑚 · 𝑑))
36		oveq1 7262	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑛 = 𝑚 → (𝑛 · 𝑑) = (𝑚 · 𝑑))
37	36	oveq2d 7271	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 = 𝑚 → (𝑎 + (𝑛 · 𝑑)) = (𝑎 + (𝑚 · 𝑑)))
38	37	rspceeqv 3567	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑚 ∈ (0...(𝐾 − 1)) ∧ (𝑎 + (𝑚 · 𝑑)) = (𝑎 + (𝑚 · 𝑑))) → ∃𝑛 ∈ (0...(𝐾 − 1))(𝑎 + (𝑚 · 𝑑)) = (𝑎 + (𝑛 · 𝑑)))
39	35, 38	mpan2 687	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑚 ∈ (0...(𝐾 − 1)) → ∃𝑛 ∈ (0...(𝐾 − 1))(𝑎 + (𝑚 · 𝑑)) = (𝑎 + (𝑛 · 𝑑)))
40	39	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → ∃𝑛 ∈ (0...(𝐾 − 1))(𝑎 + (𝑚 · 𝑑)) = (𝑎 + (𝑛 · 𝑑)))
41		vdwlem2.k	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐾 ∈ ℕ₀)
42	41	ad2antrr 722	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → 𝐾 ∈ ℕ₀)
43	42	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝐾 ∈ ℕ₀)
44		vdwapval 16602	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐾 ∈ ℕ₀ ∧ 𝑎 ∈ ℕ ∧ 𝑑 ∈ ℕ) → ((𝑎 + (𝑚 · 𝑑)) ∈ (𝑎(AP‘𝐾)𝑑) ↔ ∃𝑛 ∈ (0...(𝐾 − 1))(𝑎 + (𝑚 · 𝑑)) = (𝑎 + (𝑛 · 𝑑))))
45	43, 5, 12, 44	syl3anc 1369	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → ((𝑎 + (𝑚 · 𝑑)) ∈ (𝑎(AP‘𝐾)𝑑) ↔ ∃𝑛 ∈ (0...(𝐾 − 1))(𝑎 + (𝑚 · 𝑑)) = (𝑎 + (𝑛 · 𝑑))))
46	40, 45	mpbird 256	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝑎 + (𝑚 · 𝑑)) ∈ (𝑎(AP‘𝐾)𝑑))
47	34, 46	sseldd 3918	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝑎 + (𝑚 · 𝑑)) ∈ (^◡𝐺 “ {𝑐}))
48		vdwlem2.f	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → 𝐹:(1...𝑀)⟶𝑅)
49	48	ffvelrnda 6943	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑥 + 𝑁) ∈ (1...𝑀)) → (𝐹‘(𝑥 + 𝑁)) ∈ 𝑅)
50	31, 49	syldan 590	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...𝑊)) → (𝐹‘(𝑥 + 𝑁)) ∈ 𝑅)
51		vdwlem2.g	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝐺 = (𝑥 ∈ (1...𝑊) ↦ (𝐹‘(𝑥 + 𝑁)))
52	50, 51	fmptd 6970	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐺:(1...𝑊)⟶𝑅)
53	52	ffnd 6585	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐺 Fn (1...𝑊))
54	53	ad3antrrr 726	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → 𝐺 Fn (1...𝑊))
55		fniniseg 6919	. . . . . . . . . . . . . . . . 17 ⊢ (𝐺 Fn (1...𝑊) → ((𝑎 + (𝑚 · 𝑑)) ∈ (^◡𝐺 “ {𝑐}) ↔ ((𝑎 + (𝑚 · 𝑑)) ∈ (1...𝑊) ∧ (𝐺‘(𝑎 + (𝑚 · 𝑑))) = 𝑐)))
56	54, 55	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → ((𝑎 + (𝑚 · 𝑑)) ∈ (^◡𝐺 “ {𝑐}) ↔ ((𝑎 + (𝑚 · 𝑑)) ∈ (1...𝑊) ∧ (𝐺‘(𝑎 + (𝑚 · 𝑑))) = 𝑐)))
57	47, 56	mpbid 231	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → ((𝑎 + (𝑚 · 𝑑)) ∈ (1...𝑊) ∧ (𝐺‘(𝑎 + (𝑚 · 𝑑))) = 𝑐))
58	57	simpld 494	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝑎 + (𝑚 · 𝑑)) ∈ (1...𝑊))
59	17, 33, 58	rspcdva 3554	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → ((𝑎 + (𝑚 · 𝑑)) + 𝑁) ∈ (1...𝑀))
60	15, 59	eqeltrd 2839	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → ((𝑎 + 𝑁) + (𝑚 · 𝑑)) ∈ (1...𝑀))
61	15	fveq2d 6760	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝐹‘((𝑎 + 𝑁) + (𝑚 · 𝑑))) = (𝐹‘((𝑎 + (𝑚 · 𝑑)) + 𝑁)))
62	16	fveq2d 6760	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = (𝑎 + (𝑚 · 𝑑)) → (𝐹‘(𝑥 + 𝑁)) = (𝐹‘((𝑎 + (𝑚 · 𝑑)) + 𝑁)))
63		fvex 6769	. . . . . . . . . . . . . . 15 ⊢ (𝐹‘((𝑎 + (𝑚 · 𝑑)) + 𝑁)) ∈ V
64	62, 51, 63	fvmpt 6857	. . . . . . . . . . . . . 14 ⊢ ((𝑎 + (𝑚 · 𝑑)) ∈ (1...𝑊) → (𝐺‘(𝑎 + (𝑚 · 𝑑))) = (𝐹‘((𝑎 + (𝑚 · 𝑑)) + 𝑁)))
65	58, 64	syl 17	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝐺‘(𝑎 + (𝑚 · 𝑑))) = (𝐹‘((𝑎 + (𝑚 · 𝑑)) + 𝑁)))
66	57	simprd 495	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝐺‘(𝑎 + (𝑚 · 𝑑))) = 𝑐)
67	61, 65, 66	3eqtr2d 2784	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝐹‘((𝑎 + 𝑁) + (𝑚 · 𝑑))) = 𝑐)
68	60, 67	jca 511	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (((𝑎 + 𝑁) + (𝑚 · 𝑑)) ∈ (1...𝑀) ∧ (𝐹‘((𝑎 + 𝑁) + (𝑚 · 𝑑))) = 𝑐))
69		eleq1 2826	. . . . . . . . . . . 12 ⊢ (𝑥 = ((𝑎 + 𝑁) + (𝑚 · 𝑑)) → (𝑥 ∈ (1...𝑀) ↔ ((𝑎 + 𝑁) + (𝑚 · 𝑑)) ∈ (1...𝑀)))
70		fveqeq2 6765	. . . . . . . . . . . 12 ⊢ (𝑥 = ((𝑎 + 𝑁) + (𝑚 · 𝑑)) → ((𝐹‘𝑥) = 𝑐 ↔ (𝐹‘((𝑎 + 𝑁) + (𝑚 · 𝑑))) = 𝑐))
71	69, 70	anbi12d 630	. . . . . . . . . . 11 ⊢ (𝑥 = ((𝑎 + 𝑁) + (𝑚 · 𝑑)) → ((𝑥 ∈ (1...𝑀) ∧ (𝐹‘𝑥) = 𝑐) ↔ (((𝑎 + 𝑁) + (𝑚 · 𝑑)) ∈ (1...𝑀) ∧ (𝐹‘((𝑎 + 𝑁) + (𝑚 · 𝑑))) = 𝑐)))
72	68, 71	syl5ibrcom 246	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) ∧ 𝑚 ∈ (0...(𝐾 − 1))) → (𝑥 = ((𝑎 + 𝑁) + (𝑚 · 𝑑)) → (𝑥 ∈ (1...𝑀) ∧ (𝐹‘𝑥) = 𝑐)))
73	72	rexlimdva 3212	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → (∃𝑚 ∈ (0...(𝐾 − 1))𝑥 = ((𝑎 + 𝑁) + (𝑚 · 𝑑)) → (𝑥 ∈ (1...𝑀) ∧ (𝐹‘𝑥) = 𝑐)))
74	4	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → (𝑎 + 𝑁) ∈ ℕ)
75		simprl 767	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → 𝑑 ∈ ℕ)
76		vdwapval 16602	. . . . . . . . . 10 ⊢ ((𝐾 ∈ ℕ₀ ∧ (𝑎 + 𝑁) ∈ ℕ ∧ 𝑑 ∈ ℕ) → (𝑥 ∈ ((𝑎 + 𝑁)(AP‘𝐾)𝑑) ↔ ∃𝑚 ∈ (0...(𝐾 − 1))𝑥 = ((𝑎 + 𝑁) + (𝑚 · 𝑑))))
77	42, 74, 75, 76	syl3anc 1369	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → (𝑥 ∈ ((𝑎 + 𝑁)(AP‘𝐾)𝑑) ↔ ∃𝑚 ∈ (0...(𝐾 − 1))𝑥 = ((𝑎 + 𝑁) + (𝑚 · 𝑑))))
78	48	ffnd 6585	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 Fn (1...𝑀))
79	78	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → 𝐹 Fn (1...𝑀))
80		fniniseg 6919	. . . . . . . . . 10 ⊢ (𝐹 Fn (1...𝑀) → (𝑥 ∈ (^◡𝐹 “ {𝑐}) ↔ (𝑥 ∈ (1...𝑀) ∧ (𝐹‘𝑥) = 𝑐)))
81	79, 80	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → (𝑥 ∈ (^◡𝐹 “ {𝑐}) ↔ (𝑥 ∈ (1...𝑀) ∧ (𝐹‘𝑥) = 𝑐)))
82	73, 77, 81	3imtr4d 293	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → (𝑥 ∈ ((𝑎 + 𝑁)(AP‘𝐾)𝑑) → 𝑥 ∈ (^◡𝐹 “ {𝑐})))
83	82	ssrdv 3923	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ (𝑑 ∈ ℕ ∧ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}))) → ((𝑎 + 𝑁)(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐}))
84	83	expr 456	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ ℕ) ∧ 𝑑 ∈ ℕ) → ((𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}) → ((𝑎 + 𝑁)(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})))
85	84	reximdva 3202	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℕ) → (∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}) → ∃𝑑 ∈ ℕ ((𝑎 + 𝑁)(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})))
86		oveq1 7262	. . . . . . . 8 ⊢ (𝑏 = (𝑎 + 𝑁) → (𝑏(AP‘𝐾)𝑑) = ((𝑎 + 𝑁)(AP‘𝐾)𝑑))
87	86	sseq1d 3948	. . . . . . 7 ⊢ (𝑏 = (𝑎 + 𝑁) → ((𝑏(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐}) ↔ ((𝑎 + 𝑁)(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})))
88	87	rexbidv 3225	. . . . . 6 ⊢ (𝑏 = (𝑎 + 𝑁) → (∃𝑑 ∈ ℕ (𝑏(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐}) ↔ ∃𝑑 ∈ ℕ ((𝑎 + 𝑁)(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})))
89	88	rspcev 3552	. . . . 5 ⊢ (((𝑎 + 𝑁) ∈ ℕ ∧ ∃𝑑 ∈ ℕ ((𝑎 + 𝑁)(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})) → ∃𝑏 ∈ ℕ ∃𝑑 ∈ ℕ (𝑏(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐}))
90	4, 85, 89	syl6an 680	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ ℕ) → (∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}) → ∃𝑏 ∈ ℕ ∃𝑑 ∈ ℕ (𝑏(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})))
91	90	rexlimdva 3212	. . 3 ⊢ (𝜑 → (∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}) → ∃𝑏 ∈ ℕ ∃𝑑 ∈ ℕ (𝑏(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})))
92	91	eximdv 1921	. 2 ⊢ (𝜑 → (∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐}) → ∃𝑐∃𝑏 ∈ ℕ ∃𝑑 ∈ ℕ (𝑏(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})))
93		ovex 7288	. . 3 ⊢ (1...𝑊) ∈ V
94	93, 41, 52	vdwmc 16607	. 2 ⊢ (𝜑 → (𝐾 MonoAP 𝐺 ↔ ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (^◡𝐺 “ {𝑐})))
95		ovex 7288	. . 3 ⊢ (1...𝑀) ∈ V
96	95, 41, 48	vdwmc 16607	. 2 ⊢ (𝜑 → (𝐾 MonoAP 𝐹 ↔ ∃𝑐∃𝑏 ∈ ℕ ∃𝑑 ∈ ℕ (𝑏(AP‘𝐾)𝑑) ⊆ (^◡𝐹 “ {𝑐})))
97	92, 94, 96	3imtr4d 293	1 ⊢ (𝜑 → (𝐾 MonoAP 𝐺 → 𝐾 MonoAP 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∃wex 1783 ∈ wcel 2108 ∀wral 3063 ∃wrex 3064 ⊆ wss 3883 {csn 4558 class class class wbr 5070 ↦ cmpt 5153 ^◡ccnv 5579 “ cima 5583 Fn wfn 6413 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 Fincfn 8691 0cc0 10802 1c1 10803 + caddc 10805 · cmul 10807 − cmin 11135 ℕcn 11903 ℕ₀cn0 12163 ℤcz 12249 ℤ_≥cuz 12511 ...cfz 13168 APcvdwa 16594 MonoAP cvdwm 16595

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-fz 13169 df-vdwap 16597 df-vdwmc 16598

This theorem is referenced by: vdwlem9 16618

W3C validator