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 16916

Description: Lemma for vdw 16929. (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 7087	. . . 4 ⊢ (𝜑 → (𝐷‘𝐼) ∈ ℕ)
5		vdwlem1.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ℕ)
6	5	nnnn0d 12534	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℕ₀)
7		vdwapun 16909	. . . . . 6 ⊢ ((𝐾 ∈ ℕ₀ ∧ 𝐴 ∈ ℕ ∧ (𝐷‘𝐼) ∈ ℕ) → (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) = ({𝐴} ∪ ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼))))
8	6, 1, 4, 7	syl3anc 1371	. . . . 5 ⊢ (𝜑 → (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) = ({𝐴} ∪ ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼))))
9	1	nnred 12229	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
10		vdwlem1.m	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑀 ∈ ℕ)
11		nnuz 12867	. . . . . . . . . . . . . . 15 ⊢ ℕ = (ℤ_≥‘1)
12	10, 11	eleqtrdi 2843	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘1))
13		eluzfz1 13510	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ (ℤ_≥‘1) → 1 ∈ (1...𝑀))
14	12, 13	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → 1 ∈ (1...𝑀))
15	2, 14	ffvelcdmd 7087	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐷‘1) ∈ ℕ)
16	1, 15	nnaddcld 12266	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 + (𝐷‘1)) ∈ ℕ)
17	16	nnred 12229	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 + (𝐷‘1)) ∈ ℝ)
18		vdwlem1.w	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ ℕ)
19	18	nnred 12229	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ ℝ)
20	15	nnrpd 13016	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐷‘1) ∈ ℝ⁺)
21	9, 20	ltaddrpd 13051	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 < (𝐴 + (𝐷‘1)))
22	9, 17, 21	ltled 11364	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ≤ (𝐴 + (𝐷‘1)))
23		fveq2 6891	. . . . . . . . . . . . . 14 ⊢ (𝑖 = 1 → (𝐷‘𝑖) = (𝐷‘1))
24	23	oveq2d 7427	. . . . . . . . . . . . 13 ⊢ (𝑖 = 1 → (𝐴 + (𝐷‘𝑖)) = (𝐴 + (𝐷‘1)))
25	24	eleq1d 2818	. . . . . . . . . . . 12 ⊢ (𝑖 = 1 → ((𝐴 + (𝐷‘𝑖)) ∈ (1...𝑊) ↔ (𝐴 + (𝐷‘1)) ∈ (1...𝑊)))
26		vdwlem1.s	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → ∀𝑖 ∈ (1...𝑀)((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}))
27	26	r19.21bi 3248	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}))
28		cnvimass 6080	. . . . . . . . . . . . . . . . 17 ⊢ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) ⊆ dom 𝐹
29		vdwlem1.f	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐹:(1...𝑊)⟶𝑅)
30	28, 29	fssdm 6737	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) ⊆ (1...𝑊))
31	30	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) ⊆ (1...𝑊))
32	27, 31	sstrd 3992	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (1...𝑊))
33		nnm1nn0 12515	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐾 ∈ ℕ → (𝐾 − 1) ∈ ℕ₀)
34	5, 33	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝐾 − 1) ∈ ℕ₀)
35		nn0uz 12866	. . . . . . . . . . . . . . . . . . 19 ⊢ ℕ₀ = (ℤ_≥‘0)
36	34, 35	eleqtrdi 2843	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐾 − 1) ∈ (ℤ_≥‘0))
37		eluzfz1 13510	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐾 − 1) ∈ (ℤ_≥‘0) → 0 ∈ (0...(𝐾 − 1)))
38	36, 37	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 0 ∈ (0...(𝐾 − 1)))
39	38	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 0 ∈ (0...(𝐾 − 1)))
40	2	ffvelcdmda 7086	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐷‘𝑖) ∈ ℕ)
41	40	nncnd 12230	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐷‘𝑖) ∈ ℂ)
42	41	mul02d 11414	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (0 · (𝐷‘𝑖)) = 0)
43	42	oveq2d 7427	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖)) + (0 · (𝐷‘𝑖))) = ((𝐴 + (𝐷‘𝑖)) + 0))
44	1	adantr 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 ∈ ℕ)
45	44, 40	nnaddcld 12266	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) ∈ ℕ)
46	45	nncnd 12230	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) ∈ ℂ)
47	46	addridd 11416	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖)) + 0) = (𝐴 + (𝐷‘𝑖)))
48	43, 47	eqtr2d 2773	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (0 · (𝐷‘𝑖))))
49		oveq1 7418	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 = 0 → (𝑚 · (𝐷‘𝑖)) = (0 · (𝐷‘𝑖)))
50	49	oveq2d 7427	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 = 0 → ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖))) = ((𝐴 + (𝐷‘𝑖)) + (0 · (𝐷‘𝑖))))
51	50	rspceeqv 3633	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ (0...(𝐾 − 1)) ∧ (𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (0 · (𝐷‘𝑖)))) → ∃𝑚 ∈ (0...(𝐾 − 1))(𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖))))
52	39, 48, 51	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ∃𝑚 ∈ (0...(𝐾 − 1))(𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖))))
53	5	adantr 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐾 ∈ ℕ)
54	53	nnnn0d 12534	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐾 ∈ ℕ₀)
55		vdwapval 16908	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ ℕ₀ ∧ (𝐴 + (𝐷‘𝑖)) ∈ ℕ ∧ (𝐷‘𝑖) ∈ ℕ) → ((𝐴 + (𝐷‘𝑖)) ∈ ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ↔ ∃𝑚 ∈ (0...(𝐾 − 1))(𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖)))))
56	54, 45, 40, 55	syl3anc 1371	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → ((𝐴 + (𝐷‘𝑖)) ∈ ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ↔ ∃𝑚 ∈ (0...(𝐾 − 1))(𝐴 + (𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝑖)) + (𝑚 · (𝐷‘𝑖)))))
57	52, 56	mpbird 256	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) ∈ ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)))
58	32, 57	sseldd 3983	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → (𝐴 + (𝐷‘𝑖)) ∈ (1...𝑊))
59	58	ralrimiva 3146	. . . . . . . . . . . 12 ⊢ (𝜑 → ∀𝑖 ∈ (1...𝑀)(𝐴 + (𝐷‘𝑖)) ∈ (1...𝑊))
60	25, 59, 14	rspcdva 3613	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 + (𝐷‘1)) ∈ (1...𝑊))
61		elfzle2 13507	. . . . . . . . . . 11 ⊢ ((𝐴 + (𝐷‘1)) ∈ (1...𝑊) → (𝐴 + (𝐷‘1)) ≤ 𝑊)
62	60, 61	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 + (𝐷‘1)) ≤ 𝑊)
63	9, 17, 19, 22, 62	letrd 11373	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ≤ 𝑊)
64	1, 11	eleqtrdi 2843	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ (ℤ_≥‘1))
65	18	nnzd 12587	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ ℤ)
66		elfz5 13495	. . . . . . . . . 10 ⊢ ((𝐴 ∈ (ℤ_≥‘1) ∧ 𝑊 ∈ ℤ) → (𝐴 ∈ (1...𝑊) ↔ 𝐴 ≤ 𝑊))
67	64, 65, 66	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∈ (1...𝑊) ↔ 𝐴 ≤ 𝑊))
68	63, 67	mpbird 256	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ (1...𝑊))
69		eqidd 2733	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝐴) = (𝐹‘𝐴))
70		ffn 6717	. . . . . . . . 9 ⊢ (𝐹:(1...𝑊)⟶𝑅 → 𝐹 Fn (1...𝑊))
71		fniniseg 7061	. . . . . . . . 9 ⊢ (𝐹 Fn (1...𝑊) → (𝐴 ∈ (^◡𝐹 “ {(𝐹‘𝐴)}) ↔ (𝐴 ∈ (1...𝑊) ∧ (𝐹‘𝐴) = (𝐹‘𝐴))))
72	29, 70, 71	3syl 18	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∈ (^◡𝐹 “ {(𝐹‘𝐴)}) ↔ (𝐴 ∈ (1...𝑊) ∧ (𝐹‘𝐴) = (𝐹‘𝐴))))
73	68, 69, 72	mpbir2and 711	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (^◡𝐹 “ {(𝐹‘𝐴)}))
74	73	snssd 4812	. . . . . 6 ⊢ (𝜑 → {𝐴} ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
75		fveq2 6891	. . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (𝐷‘𝑖) = (𝐷‘𝐼))
76	75	oveq2d 7427	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → (𝐴 + (𝐷‘𝑖)) = (𝐴 + (𝐷‘𝐼)))
77	76, 75	oveq12d 7429	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → ((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) = ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼)))
78	76	fveq2d 6895	. . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (𝐹‘(𝐴 + (𝐷‘𝑖))) = (𝐹‘(𝐴 + (𝐷‘𝐼))))
79	78	sneqd 4640	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → {(𝐹‘(𝐴 + (𝐷‘𝑖)))} = {(𝐹‘(𝐴 + (𝐷‘𝐼)))})
80	79	imaeq2d 6059	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) = (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝐼)))}))
81	77, 80	sseq12d 4015	. . . . . . . 8 ⊢ (𝑖 = 𝐼 → (((𝐴 + (𝐷‘𝑖))(AP‘𝐾)(𝐷‘𝑖)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝑖)))}) ↔ ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝐼)))})))
82	81, 26, 3	rspcdva 3613	. . . . . . 7 ⊢ (𝜑 → ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝐼)))}))
83		vdwlem1.e	. . . . . . . . 9 ⊢ (𝜑 → (𝐹‘𝐴) = (𝐹‘(𝐴 + (𝐷‘𝐼))))
84	83	sneqd 4640	. . . . . . . 8 ⊢ (𝜑 → {(𝐹‘𝐴)} = {(𝐹‘(𝐴 + (𝐷‘𝐼)))})
85	84	imaeq2d 6059	. . . . . . 7 ⊢ (𝜑 → (^◡𝐹 “ {(𝐹‘𝐴)}) = (^◡𝐹 “ {(𝐹‘(𝐴 + (𝐷‘𝐼)))}))
86	82, 85	sseqtrrd 4023	. . . . . 6 ⊢ (𝜑 → ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
87	74, 86	unssd 4186	. . . . 5 ⊢ (𝜑 → ({𝐴} ∪ ((𝐴 + (𝐷‘𝐼))(AP‘𝐾)(𝐷‘𝐼))) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
88	8, 87	eqsstrd 4020	. . . 4 ⊢ (𝜑 → (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
89		oveq1 7418	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑎(AP‘(𝐾 + 1))𝑑) = (𝐴(AP‘(𝐾 + 1))𝑑))
90	89	sseq1d 4013	. . . . 5 ⊢ (𝑎 = 𝐴 → ((𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}) ↔ (𝐴(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})))
91		oveq2 7419	. . . . . 6 ⊢ (𝑑 = (𝐷‘𝐼) → (𝐴(AP‘(𝐾 + 1))𝑑) = (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)))
92	91	sseq1d 4013	. . . . 5 ⊢ (𝑑 = (𝐷‘𝐼) → ((𝐴(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}) ↔ (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})))
93	90, 92	rspc2ev 3624	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ (𝐷‘𝐼) ∈ ℕ ∧ (𝐴(AP‘(𝐾 + 1))(𝐷‘𝐼)) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})) → ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
94	1, 4, 88, 93	syl3anc 1371	. . 3 ⊢ (𝜑 → ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}))
95		fvex 6904	. . . 4 ⊢ (𝐹‘𝐴) ∈ V
96		sneq 4638	. . . . . . 7 ⊢ (𝑐 = (𝐹‘𝐴) → {𝑐} = {(𝐹‘𝐴)})
97	96	imaeq2d 6059	. . . . . 6 ⊢ (𝑐 = (𝐹‘𝐴) → (^◡𝐹 “ {𝑐}) = (^◡𝐹 “ {(𝐹‘𝐴)}))
98	97	sseq2d 4014	. . . . 5 ⊢ (𝑐 = (𝐹‘𝐴) → ((𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐}) ↔ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})))
99	98	2rexbidv 3219	. . . 4 ⊢ (𝑐 = (𝐹‘𝐴) → (∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐}) ↔ ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)})))
100	95, 99	spcev 3596	. . 3 ⊢ (∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {(𝐹‘𝐴)}) → ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐}))
101	94, 100	syl 17	. 2 ⊢ (𝜑 → ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐}))
102		ovex 7444	. . 3 ⊢ (1...𝑊) ∈ V
103		peano2nn0 12514	. . . 4 ⊢ (𝐾 ∈ ℕ₀ → (𝐾 + 1) ∈ ℕ₀)
104	6, 103	syl 17	. . 3 ⊢ (𝜑 → (𝐾 + 1) ∈ ℕ₀)
105	102, 104, 29	vdwmc 16913	. 2 ⊢ (𝜑 → ((𝐾 + 1) MonoAP 𝐹 ↔ ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘(𝐾 + 1))𝑑) ⊆ (^◡𝐹 “ {𝑐})))
106	101, 105	mpbird 256	1 ⊢ (𝜑 → (𝐾 + 1) MonoAP 𝐹)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 ∪ cun 3946 ⊆ wss 3948 {csn 4628 class class class wbr 5148 ^◡ccnv 5675 “ cima 5679 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7411 Fincfn 8941 0cc0 11112 1c1 11113 + caddc 11115 · cmul 11117 ≤ cle 11251 − cmin 11446 ℕcn 12214 ℕ₀cn0 12474 ℤcz 12560 ℤ_≥cuz 12824 ...cfz 13486 APcvdwa 16900 MonoAP cvdwm 16901

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-nn 12215 df-n0 12475 df-z 12561 df-uz 12825 df-rp 12977 df-fz 13487 df-vdwap 16903 df-vdwmc 16904

This theorem is referenced by: vdwlem6 16921

W3C validator