vdwlem1 - Metamath Proof Explorer

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

Theorem vdwlem1 16914

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

**Hypotheses**
Ref	Expression
vdwlem1.r	⊢ (𝜑 → 𝑅 ∈ Fin)
vdwlem1.k	⊢ (𝜑 → 𝐾 ∈ ℕ)
vdwlem1.w	⊢ (𝜑 → 𝑊 ∈ ℕ)
vdwlem1.f	⊢ (𝜑 → 𝐹:(1...𝑊)⟶𝑅)
vdwlem1.a	⊢ (𝜑 → 𝐴 ∈ ℕ)
vdwlem1.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
vdwlem1.d	⊢ (𝜑 → 𝐷:(1...𝑀)⟶ℕ)
vdwlem1.s	⊢ (𝜑 → ∀𝑖 ∈ (1...𝑀)((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}))
vdwlem1.i	⊢ (𝜑 → 𝐼 ∈ (1...𝑀))
vdwlem1.e	⊢ (𝜑 → (𝐹‘𝐴) = (𝐹‘(𝐴 + (𝐷‘𝐼))))

**Assertion**
Ref	Expression
vdwlem1	⊢ (𝜑 → (𝐾 + 1) MonoAP 𝐹)

Distinct variable groups: 𝐴,𝑖 𝐷,𝑖 𝑖,𝐼 𝑖,𝐾 𝑖,𝐹 𝑖,𝑀 𝜑,𝑖 𝑅,𝑖 𝑖,𝑊

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

Step	Hyp	Ref	Expression
1		vdwlem1.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℕ)
2		vdwlem1.d	. . . . 5 ⊢ (𝜑 → 𝐷:(1...𝑀)⟶ℕ)
3		vdwlem1.i	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ (1...𝑀))
4	2, 3	ffvelcdmd 7088	. . . 4 ⊢ (𝜑 → (𝐷‘𝐼) ∈ ℕ)
5		vdwlem1.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ℕ)
6	5	nnnn0d 12532	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℕ₀)
7		vdwapun 16907	. . . . . 6 ⊢ ((𝐾 ∈ ℕ₀ ∧ 𝐴 ∈ ℕ ∧ (𝐷‘𝐼) ∈ ℕ) → (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) = ({𝐴} ∪ ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼))))
8	6, 1, 4, 7	syl3anc 1372	. . . . 5 ⊢ (𝜑 → (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) = ({𝐴} ∪ ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼))))
9	1	nnred 12227	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
10		vdwlem1.m	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑀 ∈ ℕ)
11		nnuz 12865	. . . . . . . . . . . . . . 15 ⊢ ℕ = (ℤ_≥‘1)
12	10, 11	eleqtrdi 2844	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘1))
13		eluzfz1 13508	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ (ℤ_≥‘1) → 1 ∈ (1...𝑀))
14	12, 13	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → 1 ∈ (1...𝑀))
15	2, 14	ffvelcdmd 7088	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐷‘1) ∈ ℕ)
16	1, 15	nnaddcld 12264	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 + (𝐷‘1)) ∈ ℕ)
17	16	nnred 12227	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 + (𝐷‘1)) ∈ ℝ)
18		vdwlem1.w	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ ℕ)
19	18	nnred 12227	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ ℝ)
20	15	nnrpd 13014	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐷‘1) ∈ ℝ⁺)
21	9, 20	ltaddrpd 13049	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 < (𝐴 + (𝐷‘1)))
22	9, 17, 21	ltled 11362	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ≤ (𝐴 + (𝐷‘1)))
23		fveq2 6892	. . . . . . . . . . . . . 14 ⊢ (𝑖 = 1 → (𝐷‘𝑖) = (𝐷‘1))
24	23	oveq2d 7425	. . . . . . . . . . . . 13 ⊢ (𝑖 = 1 → (𝐴 + (𝐷‘𝑖)) = (𝐴 + (𝐷‘1)))
25	24	eleq1d 2819	. . . . . . . . . . . 12 ⊢ (𝑖 = 1 → ((𝐴 + (𝐷‘𝑖)) ∈ (1...𝑊) ↔ (𝐴 + (𝐷‘1)) ∈ (1...𝑊)))
26		vdwlem1.s	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑖 ∈ (1...𝑀)((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}))
27	26	r19.21bi 3249	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}))
28		cnvimass 6081	. . . . . . . . . . . . . . . . 17 ⊢ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) ⊆ dom 𝐹
29		vdwlem1.f	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐹:(1...𝑊)⟶𝑅)
30	28, 29	fssdm 6738	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) ⊆ (1...𝑊))
31	30	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) ⊆ (1...𝑊))
32	27, 31	sstrd 3993	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (1...𝑊))
33		nnm1nn0 12513	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐾 ∈ ℕ → (𝐾 − 1) ∈ ℕ₀)
34	5, 33	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝐾 − 1) ∈ ℕ₀)
35		nn0uz 12864	. . . . . . . . . . . . . . . . . . 19 ⊢ ℕ₀ = (ℤ_≥‘0)
36	34, 35	eleqtrdi 2844	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐾 − 1) ∈ (ℤ_≥‘0))
37		eluzfz1 13508	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐾 − 1) ∈ (ℤ_≥‘0) → 0 ∈ (0...(𝐾 − 1)))
38	36, 37	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 0 ∈ (0...(𝐾 − 1)))
39	38	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 0 ∈ (0...(𝐾 − 1)))
40	2	ffvelcdmda 7087	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐷‘𝑖) ∈ ℕ)
41	40	nncnd 12228	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐷‘𝑖) ∈ ℂ)
42	41	mul02d 11412	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (0 · (𝐷‘𝑖)) = 0)
43	42	oveq2d 7425	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖)) + (0 · (𝐷‘𝑖))) = ((𝐴 + (𝐷‘𝑖)) + 0))
44	1	adantr 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 ∈ ℕ)
45	44, 40	nnaddcld 12264	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) ∈ ℕ)
46	45	nncnd 12228	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) ∈ ℂ)
47	46	addridd 11414	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖)) + 0) = (𝐴 + (𝐷‘𝑖)))
48	43, 47	eqtr2d 2774	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (0 · (𝐷‘𝑖))))
49		oveq1 7416	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 = 0 → (𝑚 · (𝐷‘𝑖)) = (0 · (𝐷‘𝑖)))
50	49	oveq2d 7425	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 = 0 → ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖))) = ((𝐴 + (𝐷‘𝑖)) + (0 · (𝐷‘𝑖))))
51	50	rspceeqv 3634	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ (0...(𝐾 − 1)) ∧ (𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (0 · (𝐷‘𝑖)))) → ∃𝑚 ∈ (0...(𝐾 − 1))(𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖))))
52	39, 48, 51	syl2anc 585	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ∃𝑚 ∈ (0...(𝐾 − 1))(𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖))))
53	5	adantr 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐾 ∈ ℕ)
54	53	nnnn0d 12532	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐾 ∈ ℕ₀)
55		vdwapval 16906	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ ℕ₀ ∧ (𝐴 + (𝐷‘𝑖)) ∈ ℕ ∧ (𝐷‘𝑖) ∈ ℕ) → ((𝐴 + (𝐷‘𝑖)) ∈ ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ↔ ∃𝑚 ∈ (0...(𝐾 − 1))(𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖)))))
56	54, 45, 40, 55	syl3anc 1372	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖)) ∈ ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ↔ ∃𝑚 ∈ (0...(𝐾 − 1))(𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖)))))
57	52, 56	mpbird 257	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) ∈ ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)))
58	32, 57	sseldd 3984	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) ∈ (1...𝑊))
59	58	ralrimiva 3147	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑖 ∈ (1...𝑀)(𝐴 + (𝐷‘𝑖)) ∈ (1...𝑊))
60	25, 59, 14	rspcdva 3614	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 + (𝐷‘1)) ∈ (1...𝑊))
61		elfzle2 13505	. . . . . . . . . . 11 ⊢ ((𝐴 + (𝐷‘1)) ∈ (1...𝑊) → (𝐴 + (𝐷‘1)) ≤ 𝑊)
62	60, 61	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 + (𝐷‘1)) ≤ 𝑊)
63	9, 17, 19, 22, 62	letrd 11371	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ≤ 𝑊)
64	1, 11	eleqtrdi 2844	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ (ℤ_≥‘1))
65	18	nnzd 12585	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ ℤ)
66		elfz5 13493	. . . . . . . . . 10 ⊢ ((𝐴 ∈ (ℤ_≥‘1) ∧ 𝑊 ∈ ℤ) → (𝐴 ∈ (1...𝑊) ↔ 𝐴 ≤ 𝑊))
67	64, 65, 66	syl2anc 585	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∈ (1...𝑊) ↔ 𝐴 ≤ 𝑊))
68	63, 67	mpbird 257	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ (1...𝑊))
69		eqidd 2734	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝐴) = (𝐹‘𝐴))
70		ffn 6718	. . . . . . . . 9 ⊢ (𝐹:(1...𝑊)⟶𝑅 → 𝐹 Fn (1...𝑊))
71		fniniseg 7062	. . . . . . . . 9 ⊢ (𝐹 Fn (1...𝑊) → (𝐴 ∈ (^◡𝐹 “ {(𝐹‘𝐴)}) ↔ (𝐴 ∈ (1...𝑊) ∧ (𝐹‘𝐴) = (𝐹‘𝐴))))
72	29, 70, 71	3syl 18	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∈ (^◡𝐹 “ {(𝐹‘𝐴)}) ↔ (𝐴 ∈ (1...𝑊) ∧ (𝐹‘𝐴) = (𝐹‘𝐴))))
73	68, 69, 72	mpbir2and 712	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (^◡𝐹 “ {(𝐹‘𝐴)}))
74	73	snssd 4813	. . . . . 6 ⊢ (𝜑 → {𝐴} ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
75		fveq2 6892	. . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (𝐷‘𝑖) = (𝐷‘𝐼))
76	75	oveq2d 7425	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → (𝐴 + (𝐷‘𝑖)) = (𝐴 + (𝐷‘𝐼)))
77	76, 75	oveq12d 7427	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼)))
78	76	fveq2d 6896	. . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (𝐹‘(𝐴 + (𝐷‘𝑖))) = (𝐹‘(𝐴 + (𝐷‘𝐼))))
79	78	sneqd 4641	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → {(𝐹‘(𝐴 + (𝐷‘𝑖)))} = {(𝐹‘(𝐴 + (𝐷‘𝐼)))})
80	79	imaeq2d 6060	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) = (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝐼)))}))
81	77, 80	sseq12d 4016	. . . . . . . 8 ⊢ (𝑖 = 𝐼 → (((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) ↔ ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝐼)))})))
82	81, 26, 3	rspcdva 3614	. . . . . . 7 ⊢ (𝜑 → ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝐼)))}))
83		vdwlem1.e	. . . . . . . . 9 ⊢ (𝜑 → (𝐹‘𝐴) = (𝐹‘(𝐴 + (𝐷‘𝐼))))
84	83	sneqd 4641	. . . . . . . 8 ⊢ (𝜑 → {(𝐹‘𝐴)} = {(𝐹‘(𝐴 + (𝐷‘𝐼)))})
85	84	imaeq2d 6060	. . . . . . 7 ⊢ (𝜑 → (^◡𝐹 “ {(𝐹‘𝐴)}) = (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝐼)))}))
86	82, 85	sseqtrrd 4024	. . . . . 6 ⊢ (𝜑 → ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
87	74, 86	unssd 4187	. . . . 5 ⊢ (𝜑 → ({𝐴} ∪ ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼))) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
88	8, 87	eqsstrd 4021	. . . 4 ⊢ (𝜑 → (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
89		oveq1 7416	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑎(AP‘(𝐾 + 1))𝑑) = (𝐴(AP‘(𝐾 + 1))𝑑))
90	89	sseq1d 4014	. . . . 5 ⊢ (𝑎 = 𝐴 → ((𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}) ↔ (𝐴(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})))
91		oveq2 7417	. . . . . 6 ⊢ (𝑑 = (𝐷‘𝐼) → (𝐴(AP‘(𝐾 + 1))𝑑) = (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)))
92	91	sseq1d 4014	. . . . 5 ⊢ (𝑑 = (𝐷‘𝐼) → ((𝐴(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}) ↔ (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})))
93	90, 92	rspc2ev 3625	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ (𝐷‘𝐼) ∈ ℕ ∧ (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})) → ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
94	1, 4, 88, 93	syl3anc 1372	. . 3 ⊢ (𝜑 → ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
95		fvex 6905	. . . 4 ⊢ (𝐹‘𝐴) ∈ V
96		sneq 4639	. . . . . . 7 ⊢ (𝑐 = (𝐹‘𝐴) → {𝑐} = {(𝐹‘𝐴)})
97	96	imaeq2d 6060	. . . . . 6 ⊢ (𝑐 = (𝐹‘𝐴) → (^◡𝐹 “ {𝑐}) = (^◡𝐹 “ {(𝐹‘𝐴)}))
98	97	sseq2d 4015	. . . . 5 ⊢ (𝑐 = (𝐹‘𝐴) → ((𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐}) ↔ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})))
99	98	2rexbidv 3220	. . . 4 ⊢ (𝑐 = (𝐹‘𝐴) → (∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐}) ↔ ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})))
100	95, 99	spcev 3597	. . 3 ⊢ (∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}) → ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐}))
101	94, 100	syl 17	. 2 ⊢ (𝜑 → ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐}))
102		ovex 7442	. . 3 ⊢ (1...𝑊) ∈ V
103		peano2nn0 12512	. . . 4 ⊢ (𝐾 ∈ ℕ₀ → (𝐾 + 1) ∈ ℕ₀)
104	6, 103	syl 17	. . 3 ⊢ (𝜑 → (𝐾 + 1) ∈ ℕ₀)
105	102, 104, 29	vdwmc 16911	. 2 ⊢ (𝜑 → ((𝐾 + 1) MonoAP 𝐹 ↔ ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐})))
106	101, 105	mpbird 257	1 ⊢ (𝜑 → (𝐾 + 1) MonoAP 𝐹)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∃wex 1782 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 ∪ cun 3947 ⊆ wss 3949 {csn 4629 class class class wbr 5149 ^◡ccnv 5676 “ cima 5680 Fn wfn 6539 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 Fincfn 8939 0cc0 11110 1c1 11111 + caddc 11113 · cmul 11115 ≤ cle 11249 − cmin 11444 ℕcn 12212 ℕ₀cn0 12472 ℤcz 12558 ℤ_≥cuz 12822 ...cfz 13484 APcvdwa 16898 MonoAP cvdwm 16899

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-n0 12473 df-z 12559 df-uz 12823 df-rp 12975 df-fz 13485 df-vdwap 16901 df-vdwmc 16902

This theorem is referenced by: vdwlem6 16919

W3C validator