Theorem vdwlem13 17048

Description: Lemma for vdw 17049. Main induction on 𝐾; 𝐾 = 0, 𝐾 = 1 base cases. (Contributed by Mario Carneiro, 18-Aug-2014.)

Hypotheses

Ref	Expression
vdw.r	⊢ (𝜑 → 𝑅 ∈ Fin)
vdw.k	⊢ (𝜑 → 𝐾 ∈ ℕ0)

Assertion

Ref	Expression
vdwlem13	⊢ (𝜑 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓)

Distinct variable groups:   𝜑,𝑛,𝑓   𝑓,𝐾,𝑛   𝑅,𝑓,𝑛   𝜑,𝑓

Proof of Theorem vdwlem13

Dummy variables 𝑎 𝑐 𝑑 𝑔 𝑘 𝑚 𝑥 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnn1uz2 12944	. . 3 ⊢ (𝐾 ∈ ℕ ↔ (𝐾 = 1 ∨ 𝐾 ∈ (ℤ≥‘2)))
2		vdw.r	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ Fin)
3		ovex 7443	. . . . . . . . . 10 ⊢ (1...1) ∈ V
4		elmapg 8832	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Fin ∧ (1...1) ∈ V) → (𝑓 ∈ (𝑅 ↑m (1...1)) ↔ 𝑓:(1...1)⟶𝑅))
5	2, 3, 4	sylancl 597	. . . . . . . . 9 ⊢ (𝜑 → (𝑓 ∈ (𝑅 ↑m (1...1)) ↔ 𝑓:(1...1)⟶𝑅))
6	5	biimpa 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑅 ↑m (1...1))) → 𝑓:(1...1)⟶𝑅)
7		1nn 12239	. . . . . . . . . 10 ⊢ 1 ∈ ℕ
8		vdwap1 17032	. . . . . . . . . 10 ⊢ ((1 ∈ ℕ ∧ 1 ∈ ℕ) → (1(AP‘1)1) = {1})
9	7, 7, 8	mp2an 704	. . . . . . . . 9 ⊢ (1(AP‘1)1) = {1}
10		1z 12619	. . . . . . . . . . . 12 ⊢ 1 ∈ ℤ
11		elfz3 13557	. . . . . . . . . . . 12 ⊢ (1 ∈ ℤ → 1 ∈ (1...1))
12	10, 11	mp1i 14	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓:(1...1)⟶𝑅) → 1 ∈ (1...1))
13		eqidd 2764	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓:(1...1)⟶𝑅) → (𝑓‘1) = (𝑓‘1))
14		ffn 6705	. . . . . . . . . . . . 13 ⊢ (𝑓:(1...1)⟶𝑅 → 𝑓 Fn (1...1))
15	14	adantl 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓:(1...1)⟶𝑅) → 𝑓 Fn (1...1))
16		fniniseg 7055	. . . . . . . . . . . 12 ⊢ (𝑓 Fn (1...1) → (1 ∈ (◡𝑓 “ {(𝑓‘1)}) ↔ (1 ∈ (1...1) ∧ (𝑓‘1) = (𝑓‘1))))
17	15, 16	syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓:(1...1)⟶𝑅) → (1 ∈ (◡𝑓 “ {(𝑓‘1)}) ↔ (1 ∈ (1...1) ∧ (𝑓‘1) = (𝑓‘1))))
18	12, 13, 17	mpbir2and 725	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:(1...1)⟶𝑅) → 1 ∈ (◡𝑓 “ {(𝑓‘1)}))
19	18	snssd 4752	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:(1...1)⟶𝑅) → {1} ⊆ (◡𝑓 “ {(𝑓‘1)}))
20	9, 19	eqsstrid 3975	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:(1...1)⟶𝑅) → (1(AP‘1)1) ⊆ (◡𝑓 “ {(𝑓‘1)}))
21	6, 20	syldan 602	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑅 ↑m (1...1))) → (1(AP‘1)1) ⊆ (◡𝑓 “ {(𝑓‘1)}))
22	21	ralrimiva 3157	. . . . . 6 ⊢ (𝜑 → ∀𝑓 ∈ (𝑅 ↑m (1...1))(1(AP‘1)1) ⊆ (◡𝑓 “ {(𝑓‘1)}))
23		fveq2 6881	. . . . . . . . 9 ⊢ (𝐾 = 1 → (AP‘𝐾) = (AP‘1))
24	23	oveqd 7427	. . . . . . . 8 ⊢ (𝐾 = 1 → (1(AP‘𝐾)1) = (1(AP‘1)1))
25	24	sseq1d 3968	. . . . . . 7 ⊢ (𝐾 = 1 → ((1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}) ↔ (1(AP‘1)1) ⊆ (◡𝑓 “ {(𝑓‘1)})))
26	25	ralbidv 3188	. . . . . 6 ⊢ (𝐾 = 1 → (∀𝑓 ∈ (𝑅 ↑m (1...1))(1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}) ↔ ∀𝑓 ∈ (𝑅 ↑m (1...1))(1(AP‘1)1) ⊆ (◡𝑓 “ {(𝑓‘1)})))
27	22, 26	syl5ibrcom 250	. . . . 5 ⊢ (𝜑 → (𝐾 = 1 → ∀𝑓 ∈ (𝑅 ↑m (1...1))(1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)})))
28		oveq1 7417	. . . . . . . . . . . 12 ⊢ (𝑎 = 1 → (𝑎(AP‘𝐾)𝑑) = (1(AP‘𝐾)𝑑))
29	28	sseq1d 3968	. . . . . . . . . . 11 ⊢ (𝑎 = 1 → ((𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {(𝑓‘1)}) ↔ (1(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {(𝑓‘1)})))
30		oveq2 7418	. . . . . . . . . . . 12 ⊢ (𝑑 = 1 → (1(AP‘𝐾)𝑑) = (1(AP‘𝐾)1))
31	30	sseq1d 3968	. . . . . . . . . . 11 ⊢ (𝑑 = 1 → ((1(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {(𝑓‘1)}) ↔ (1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)})))
32	29, 31	rspc2ev 3594	. . . . . . . . . 10 ⊢ ((1 ∈ ℕ ∧ 1 ∈ ℕ ∧ (1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)})) → ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {(𝑓‘1)}))
33	7, 7, 32	mp3an12 1480	. . . . . . . . 9 ⊢ ((1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}) → ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {(𝑓‘1)}))
34		fvex 6894	. . . . . . . . . 10 ⊢ (𝑓‘1) ∈ V
35		sneq 4599	. . . . . . . . . . . . 13 ⊢ (𝑐 = (𝑓‘1) → {𝑐} = {(𝑓‘1)})
36	35	imaeq2d 6062	. . . . . . . . . . . 12 ⊢ (𝑐 = (𝑓‘1) → (◡𝑓 “ {𝑐}) = (◡𝑓 “ {(𝑓‘1)}))
37	36	sseq2d 3969	. . . . . . . . . . 11 ⊢ (𝑐 = (𝑓‘1) → ((𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {𝑐}) ↔ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {(𝑓‘1)})))
38	37	2rexbidv 3230	. . . . . . . . . 10 ⊢ (𝑐 = (𝑓‘1) → (∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {𝑐}) ↔ ∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {(𝑓‘1)})))
39	34, 38	spcev 3565	. . . . . . . . 9 ⊢ (∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {(𝑓‘1)}) → ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {𝑐}))
40	33, 39	syl 18	. . . . . . . 8 ⊢ ((1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}) → ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {𝑐}))
41		vdw.k	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ ℕ0)
42	41	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑅 ↑m (1...1))) → 𝐾 ∈ ℕ0)
43	3, 42, 6	vdwmc 17033	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑅 ↑m (1...1))) → (𝐾 MonoAP 𝑓 ↔ ∃𝑐∃𝑎 ∈ ℕ ∃𝑑 ∈ ℕ (𝑎(AP‘𝐾)𝑑) ⊆ (◡𝑓 “ {𝑐})))
44	40, 43	imbitrrid 249	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑅 ↑m (1...1))) → ((1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}) → 𝐾 MonoAP 𝑓))
45	44	ralimdva 3177	. . . . . 6 ⊢ (𝜑 → (∀𝑓 ∈ (𝑅 ↑m (1...1))(1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}) → ∀𝑓 ∈ (𝑅 ↑m (1...1))𝐾 MonoAP 𝑓))
46		oveq2 7418	. . . . . . . . . 10 ⊢ (𝑛 = 1 → (1...𝑛) = (1...1))
47	46	oveq2d 7426	. . . . . . . . 9 ⊢ (𝑛 = 1 → (𝑅 ↑m (1...𝑛)) = (𝑅 ↑m (1...1)))
48	47	raleqdv 3323	. . . . . . . 8 ⊢ (𝑛 = 1 → (∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓 ↔ ∀𝑓 ∈ (𝑅 ↑m (1...1))𝐾 MonoAP 𝑓))
49	48	rspcev 3581	. . . . . . 7 ⊢ ((1 ∈ ℕ ∧ ∀𝑓 ∈ (𝑅 ↑m (1...1))𝐾 MonoAP 𝑓) → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓)
50	7, 49	mpan 702	. . . . . 6 ⊢ (∀𝑓 ∈ (𝑅 ↑m (1...1))𝐾 MonoAP 𝑓 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓)
51	45, 50	syl6 36	. . . . 5 ⊢ (𝜑 → (∀𝑓 ∈ (𝑅 ↑m (1...1))(1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}) → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
52	27, 51	syld 48	. . . 4 ⊢ (𝜑 → (𝐾 = 1 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
53		breq1 5112	. . . . . . . 8 ⊢ (𝑥 = 2 → (𝑥 MonoAP 𝑓 ↔ 2 MonoAP 𝑓))
54	53	rexralbidv 3231	. . . . . . 7 ⊢ (𝑥 = 2 → (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑥 MonoAP 𝑓 ↔ ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))2 MonoAP 𝑓))
55	54	ralbidv 3188	. . . . . 6 ⊢ (𝑥 = 2 → (∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑥 MonoAP 𝑓 ↔ ∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))2 MonoAP 𝑓))
56		breq1 5112	. . . . . . . 8 ⊢ (𝑥 = 𝑘 → (𝑥 MonoAP 𝑓 ↔ 𝑘 MonoAP 𝑓))
57	56	rexralbidv 3231	. . . . . . 7 ⊢ (𝑥 = 𝑘 → (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑥 MonoAP 𝑓 ↔ ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑘 MonoAP 𝑓))
58	57	ralbidv 3188	. . . . . 6 ⊢ (𝑥 = 𝑘 → (∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑥 MonoAP 𝑓 ↔ ∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑘 MonoAP 𝑓))
59		breq1 5112	. . . . . . . 8 ⊢ (𝑥 = (𝑘 + 1) → (𝑥 MonoAP 𝑓 ↔ (𝑘 + 1) MonoAP 𝑓))
60	59	rexralbidv 3231	. . . . . . 7 ⊢ (𝑥 = (𝑘 + 1) → (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑥 MonoAP 𝑓 ↔ ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))(𝑘 + 1) MonoAP 𝑓))
61	60	ralbidv 3188	. . . . . 6 ⊢ (𝑥 = (𝑘 + 1) → (∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑥 MonoAP 𝑓 ↔ ∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))(𝑘 + 1) MonoAP 𝑓))
62		breq1 5112	. . . . . . . 8 ⊢ (𝑥 = 𝐾 → (𝑥 MonoAP 𝑓 ↔ 𝐾 MonoAP 𝑓))
63	62	rexralbidv 3231	. . . . . . 7 ⊢ (𝑥 = 𝐾 → (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑥 MonoAP 𝑓 ↔ ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
64	63	ralbidv 3188	. . . . . 6 ⊢ (𝑥 = 𝐾 → (∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑥 MonoAP 𝑓 ↔ ∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
65		hashcl 14388	. . . . . . . . 9 ⊢ (𝑟 ∈ Fin → (♯‘𝑟) ∈ ℕ0)
66		nn0p1nn 12538	. . . . . . . . 9 ⊢ ((♯‘𝑟) ∈ ℕ0 → ((♯‘𝑟) + 1) ∈ ℕ)
67	65, 66	syl 18	. . . . . . . 8 ⊢ (𝑟 ∈ Fin → ((♯‘𝑟) + 1) ∈ ℕ)
68		simpll 778	. . . . . . . . . . 11 ⊢ (((𝑟 ∈ Fin ∧ 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))) ∧ ¬ 2 MonoAP 𝑓) → 𝑟 ∈ Fin)
69		simplr 780	. . . . . . . . . . . 12 ⊢ (((𝑟 ∈ Fin ∧ 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))) ∧ ¬ 2 MonoAP 𝑓) → 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1))))
70		vex 3459	. . . . . . . . . . . . 13 ⊢ 𝑟 ∈ V
71		ovex 7443	. . . . . . . . . . . . 13 ⊢ (1...((♯‘𝑟) + 1)) ∈ V
72	70, 71	elmap 8865	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1))) ↔ 𝑓:(1...((♯‘𝑟) + 1))⟶𝑟)
73	69, 72	sylib 221	. . . . . . . . . . 11 ⊢ (((𝑟 ∈ Fin ∧ 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))) ∧ ¬ 2 MonoAP 𝑓) → 𝑓:(1...((♯‘𝑟) + 1))⟶𝑟)
74		simpr 489	. . . . . . . . . . 11 ⊢ (((𝑟 ∈ Fin ∧ 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))) ∧ ¬ 2 MonoAP 𝑓) → ¬ 2 MonoAP 𝑓)
75	68, 73, 74	vdwlem12 17047	. . . . . . . . . 10 ⊢ ¬ ((𝑟 ∈ Fin ∧ 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))) ∧ ¬ 2 MonoAP 𝑓)
76		iman 406	. . . . . . . . . 10 ⊢ (((𝑟 ∈ Fin ∧ 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))) → 2 MonoAP 𝑓) ↔ ¬ ((𝑟 ∈ Fin ∧ 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))) ∧ ¬ 2 MonoAP 𝑓))
77	75, 76	mpbir 234	. . . . . . . . 9 ⊢ ((𝑟 ∈ Fin ∧ 𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))) → 2 MonoAP 𝑓)
78	77	ralrimiva 3157	. . . . . . . 8 ⊢ (𝑟 ∈ Fin → ∀𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))2 MonoAP 𝑓)
79		oveq2 7418	. . . . . . . . . . 11 ⊢ (𝑛 = ((♯‘𝑟) + 1) → (1...𝑛) = (1...((♯‘𝑟) + 1)))
80	79	oveq2d 7426	. . . . . . . . . 10 ⊢ (𝑛 = ((♯‘𝑟) + 1) → (𝑟 ↑m (1...𝑛)) = (𝑟 ↑m (1...((♯‘𝑟) + 1))))
81	80	raleqdv 3323	. . . . . . . . 9 ⊢ (𝑛 = ((♯‘𝑟) + 1) → (∀𝑓 ∈ (𝑟 ↑m (1...𝑛))2 MonoAP 𝑓 ↔ ∀𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))2 MonoAP 𝑓))
82	81	rspcev 3581	. . . . . . . 8 ⊢ ((((♯‘𝑟) + 1) ∈ ℕ ∧ ∀𝑓 ∈ (𝑟 ↑m (1...((♯‘𝑟) + 1)))2 MonoAP 𝑓) → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))2 MonoAP 𝑓)
83	67, 78, 82	syl2anc 595	. . . . . . 7 ⊢ (𝑟 ∈ Fin → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))2 MonoAP 𝑓)
84	83	rgen 3081	. . . . . 6 ⊢ ∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))2 MonoAP 𝑓
85		oveq1 7417	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑠 → (𝑟 ↑m (1...𝑛)) = (𝑠 ↑m (1...𝑛)))
86	85	raleqdv 3323	. . . . . . . . . 10 ⊢ (𝑟 = 𝑠 → (∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑘 MonoAP 𝑓 ↔ ∀𝑓 ∈ (𝑠 ↑m (1...𝑛))𝑘 MonoAP 𝑓))
87	86	rexbidv 3189	. . . . . . . . 9 ⊢ (𝑟 = 𝑠 → (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑘 MonoAP 𝑓 ↔ ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑠 ↑m (1...𝑛))𝑘 MonoAP 𝑓))
88		oveq2 7418	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑚 → (1...𝑛) = (1...𝑚))
89	88	oveq2d 7426	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → (𝑠 ↑m (1...𝑛)) = (𝑠 ↑m (1...𝑚)))
90	89	raleqdv 3323	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑚 → (∀𝑓 ∈ (𝑠 ↑m (1...𝑛))𝑘 MonoAP 𝑓 ↔ ∀𝑓 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑓))
91		breq2 5113	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → (𝑘 MonoAP 𝑓 ↔ 𝑘 MonoAP 𝑔))
92	91	cbvralvw 3243	. . . . . . . . . . 11 ⊢ (∀𝑓 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑓 ↔ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔)
93	90, 92	bitrdi 290	. . . . . . . . . 10 ⊢ (𝑛 = 𝑚 → (∀𝑓 ∈ (𝑠 ↑m (1...𝑛))𝑘 MonoAP 𝑓 ↔ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔))
94	93	cbvrexvw 3244	. . . . . . . . 9 ⊢ (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑠 ↑m (1...𝑛))𝑘 MonoAP 𝑓 ↔ ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔)
95	87, 94	bitrdi 290	. . . . . . . 8 ⊢ (𝑟 = 𝑠 → (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑘 MonoAP 𝑓 ↔ ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔))
96	95	cbvralvw 3243	. . . . . . 7 ⊢ (∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑘 MonoAP 𝑓 ↔ ∀𝑠 ∈ Fin ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔)
97		simplr 780	. . . . . . . . . 10 ⊢ (((𝑘 ∈ (ℤ≥‘2) ∧ 𝑟 ∈ Fin) ∧ ∀𝑠 ∈ Fin ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔) → 𝑟 ∈ Fin)
98		simpll 778	. . . . . . . . . 10 ⊢ (((𝑘 ∈ (ℤ≥‘2) ∧ 𝑟 ∈ Fin) ∧ ∀𝑠 ∈ Fin ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔) → 𝑘 ∈ (ℤ≥‘2))
99	94	ralbii 3111	. . . . . . . . . . 11 ⊢ (∀𝑠 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑠 ↑m (1...𝑛))𝑘 MonoAP 𝑓 ↔ ∀𝑠 ∈ Fin ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔)
100	99	bilanri 511	. . . . . . . . . 10 ⊢ (((𝑘 ∈ (ℤ≥‘2) ∧ 𝑟 ∈ Fin) ∧ ∀𝑠 ∈ Fin ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔) → ∀𝑠 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑠 ↑m (1...𝑛))𝑘 MonoAP 𝑓)
101	97, 98, 100	vdwlem11 17046	. . . . . . . . 9 ⊢ (((𝑘 ∈ (ℤ≥‘2) ∧ 𝑟 ∈ Fin) ∧ ∀𝑠 ∈ Fin ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔) → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))(𝑘 + 1) MonoAP 𝑓)
102	101	ex 417	. . . . . . . 8 ⊢ ((𝑘 ∈ (ℤ≥‘2) ∧ 𝑟 ∈ Fin) → (∀𝑠 ∈ Fin ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))(𝑘 + 1) MonoAP 𝑓))
103	102	ralrimdva 3165	. . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘2) → (∀𝑠 ∈ Fin ∃𝑚 ∈ ℕ ∀𝑔 ∈ (𝑠 ↑m (1...𝑚))𝑘 MonoAP 𝑔 → ∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))(𝑘 + 1) MonoAP 𝑓))
104	96, 103	biimtrid 245	. . . . . 6 ⊢ (𝑘 ∈ (ℤ≥‘2) → (∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝑘 MonoAP 𝑓 → ∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))(𝑘 + 1) MonoAP 𝑓))
105	55, 58, 61, 64, 84, 104	uzind4i 12929	. . . . 5 ⊢ (𝐾 ∈ (ℤ≥‘2) → ∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝐾 MonoAP 𝑓)
106		oveq1 7417	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑟 ↑m (1...𝑛)) = (𝑅 ↑m (1...𝑛)))
107	106	raleqdv 3323	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝐾 MonoAP 𝑓 ↔ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
108	107	rexbidv 3189	. . . . . 6 ⊢ (𝑟 = 𝑅 → (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝐾 MonoAP 𝑓 ↔ ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
109	108	rspcv 3577	. . . . 5 ⊢ (𝑅 ∈ Fin → (∀𝑟 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑟 ↑m (1...𝑛))𝐾 MonoAP 𝑓 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
110	2, 105, 109	syl2im 41	. . . 4 ⊢ (𝜑 → (𝐾 ∈ (ℤ≥‘2) → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
111	52, 110	jaod 872	. . 3 ⊢ (𝜑 → ((𝐾 = 1 ∨ 𝐾 ∈ (ℤ≥‘2)) → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
112	1, 111	biimtrid 245	. 2 ⊢ (𝜑 → (𝐾 ∈ ℕ → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
113		fveq2 6881	. . . . . . 7 ⊢ (𝐾 = 0 → (AP‘𝐾) = (AP‘0))
114	113	oveqd 7427	. . . . . 6 ⊢ (𝐾 = 0 → (1(AP‘𝐾)1) = (1(AP‘0)1))
115		vdwap0 17031	. . . . . . 7 ⊢ ((1 ∈ ℕ ∧ 1 ∈ ℕ) → (1(AP‘0)1) = ∅)
116	7, 7, 115	mp2an 704	. . . . . 6 ⊢ (1(AP‘0)1) = ∅
117	114, 116	eqtrdi 2814	. . . . 5 ⊢ (𝐾 = 0 → (1(AP‘𝐾)1) = ∅)
118		0ss 4357	. . . . 5 ⊢ ∅ ⊆ (◡𝑓 “ {(𝑓‘1)})
119	117, 118	eqsstrdi 3981	. . . 4 ⊢ (𝐾 = 0 → (1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}))
120	119	ralrimivw 3161	. . 3 ⊢ (𝐾 = 0 → ∀𝑓 ∈ (𝑅 ↑m (1...1))(1(AP‘𝐾)1) ⊆ (◡𝑓 “ {(𝑓‘1)}))
121	120, 51	syl5 35	. 2 ⊢ (𝜑 → (𝐾 = 0 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓))
122		elnn0 12501	. . 3 ⊢ (𝐾 ∈ ℕ0 ↔ (𝐾 ∈ ℕ ∨ 𝐾 = 0))
123	41, 122	sylib 221	. 2 ⊢ (𝜑 → (𝐾 ∈ ℕ ∨ 𝐾 = 0))
124	112, 121, 123	mpjaod 873	1 ⊢ (𝜑 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅 ↑m (1...𝑛))𝐾 MonoAP 𝑓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   = wceq 1570  ∃wex 1809   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089  Vcvv 3455   ⊆ wss 3905  ∅c0 4286  {csn 4589   class class class wbr 5109  ^◡ccnv 5660   “ cima 5664   Fn wfn 6531  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ↑_m cmap 8820  Fincfn 8939  0cc0 11095  1c1 11096   + caddc 11098  ℕcn 12228  2c2 12290  ℕ₀cn0 12499  ℤcz 12586  ℤ_≥cuz 12857  ...cfz 13530  ♯chash 14362  APcvdwa 17020   MonoAP cvdwm 17021

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-addrcl 11156  ax-mulcl 11157  ax-mulrcl 11158  ax-mulcom 11159  ax-addass 11160  ax-mulass 11161  ax-distr 11162  ax-i2m1 11163  ax-1ne0 11164  ax-1rid 11165  ax-rnegex 11166  ax-rrecex 11167  ax-cnre 11168  ax-pre-lttri 11169  ax-pre-lttrn 11170  ax-pre-ltadd 11171  ax-pre-mulgt0 11172

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-oadd 8453  df-er 8690  df-map 8822  df-pm 8823  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-dju 9883  df-card 9921  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-le 11244  df-sub 11438  df-neg 11439  df-nn 12229  df-2 12298  df-n0 12500  df-xnn0 12573  df-z 12587  df-uz 12858  df-rp 13012  df-fz 13531  df-hash 14363  df-vdwap 17023  df-vdwmc 17024  df-vdwpc 17025

This theorem is referenced by:  vdw  17049