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

Theorem vdwlem11 16173
Description: Lemma for vdw 16176. (Contributed by Mario Carneiro, 18-Aug-2014.)
Hypotheses
Ref Expression
vdw.r (𝜑𝑅 ∈ Fin)
vdwlem9.k (𝜑𝐾 ∈ (ℤ‘2))
vdwlem9.s (𝜑 → ∀𝑠 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑠𝑚 (1...𝑛))𝐾 MonoAP 𝑓)
Assertion
Ref Expression
vdwlem11 (𝜑 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅𝑚 (1...𝑛))(𝐾 + 1) MonoAP 𝑓)
Distinct variable groups:   𝜑,𝑛,𝑓   𝑓,𝑠,𝐾,𝑛   𝑅,𝑓,𝑛,𝑠   𝜑,𝑓
Allowed substitution hint:   𝜑(𝑠)

Proof of Theorem vdwlem11
Dummy variables 𝑎 𝑑 𝑖 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vdw.r . . 3 (𝜑𝑅 ∈ Fin)
2 vdwlem9.k . . 3 (𝜑𝐾 ∈ (ℤ‘2))
3 vdwlem9.s . . 3 (𝜑 → ∀𝑠 ∈ Fin ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑠𝑚 (1...𝑛))𝐾 MonoAP 𝑓)
4 hashcl 13525 . . . . 5 (𝑅 ∈ Fin → (♯‘𝑅) ∈ ℕ0)
51, 4syl 17 . . . 4 (𝜑 → (♯‘𝑅) ∈ ℕ0)
6 nn0p1nn 11741 . . . 4 ((♯‘𝑅) ∈ ℕ0 → ((♯‘𝑅) + 1) ∈ ℕ)
75, 6syl 17 . . 3 (𝜑 → ((♯‘𝑅) + 1) ∈ ℕ)
81, 2, 3, 7vdwlem10 16172 . 2 (𝜑 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅𝑚 (1...𝑛))(⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 ∨ (𝐾 + 1) MonoAP 𝑓))
91adantr 473 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → 𝑅 ∈ Fin)
10 ovex 7002 . . . . . . 7 (1...𝑛) ∈ V
11 elmapg 8211 . . . . . . 7 ((𝑅 ∈ Fin ∧ (1...𝑛) ∈ V) → (𝑓 ∈ (𝑅𝑚 (1...𝑛)) ↔ 𝑓:(1...𝑛)⟶𝑅))
129, 10, 11sylancl 577 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (𝑓 ∈ (𝑅𝑚 (1...𝑛)) ↔ 𝑓:(1...𝑛)⟶𝑅))
1312biimpa 469 . . . . 5 (((𝜑𝑛 ∈ ℕ) ∧ 𝑓 ∈ (𝑅𝑚 (1...𝑛))) → 𝑓:(1...𝑛)⟶𝑅)
145nn0red 11761 . . . . . . . . . . 11 (𝜑 → (♯‘𝑅) ∈ ℝ)
1514ltp1d 11363 . . . . . . . . . 10 (𝜑 → (♯‘𝑅) < ((♯‘𝑅) + 1))
16 peano2re 10605 . . . . . . . . . . . 12 ((♯‘𝑅) ∈ ℝ → ((♯‘𝑅) + 1) ∈ ℝ)
1714, 16syl 17 . . . . . . . . . . 11 (𝜑 → ((♯‘𝑅) + 1) ∈ ℝ)
1814, 17ltnled 10579 . . . . . . . . . 10 (𝜑 → ((♯‘𝑅) < ((♯‘𝑅) + 1) ↔ ¬ ((♯‘𝑅) + 1) ≤ (♯‘𝑅)))
1915, 18mpbid 224 . . . . . . . . 9 (𝜑 → ¬ ((♯‘𝑅) + 1) ≤ (♯‘𝑅))
2019adantr 473 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → ¬ ((♯‘𝑅) + 1) ≤ (♯‘𝑅))
21 eluz2nn 12091 . . . . . . . . . . . . 13 (𝐾 ∈ (ℤ‘2) → 𝐾 ∈ ℕ)
222, 21syl 17 . . . . . . . . . . . 12 (𝜑𝐾 ∈ ℕ)
2322adantr 473 . . . . . . . . . . 11 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → 𝐾 ∈ ℕ)
2423nnnn0d 11760 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → 𝐾 ∈ ℕ0)
25 simprr 760 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → 𝑓:(1...𝑛)⟶𝑅)
267adantr 473 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → ((♯‘𝑅) + 1) ∈ ℕ)
27 eqid 2772 . . . . . . . . . 10 (1...((♯‘𝑅) + 1)) = (1...((♯‘𝑅) + 1))
2810, 24, 25, 26, 27vdwpc 16162 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → (⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 ↔ ∃𝑎 ∈ ℕ ∃𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1)))(∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))}) ∧ (♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) = ((♯‘𝑅) + 1))))
291ad3antrrr 717 . . . . . . . . . . . . . 14 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → 𝑅 ∈ Fin)
3025ad2antrr 713 . . . . . . . . . . . . . . . . . . 19 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) → 𝑓:(1...𝑛)⟶𝑅)
3125ad3antrrr 717 . . . . . . . . . . . . . . . . . . . . . 22 (((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) ∧ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → 𝑓:(1...𝑛)⟶𝑅)
32 simpr 477 . . . . . . . . . . . . . . . . . . . . . . 23 (((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) ∧ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))}))
33 cnvimass 5783 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))}) ⊆ dom 𝑓
3432, 33syl6ss 3866 . . . . . . . . . . . . . . . . . . . . . 22 (((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) ∧ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ dom 𝑓)
3531, 34fssdmd 6353 . . . . . . . . . . . . . . . . . . . . 21 (((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) ∧ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (1...𝑛))
3622ad3antrrr 717 . . . . . . . . . . . . . . . . . . . . . . 23 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) → 𝐾 ∈ ℕ)
37 simplrl 764 . . . . . . . . . . . . . . . . . . . . . . . 24 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) → 𝑎 ∈ ℕ)
38 simprr 760 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) → 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))
39 nnex 11438 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 ℕ ∈ V
40 ovex 7002 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (1...((♯‘𝑅) + 1)) ∈ V
4139, 40elmap 8227 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))) ↔ 𝑑:(1...((♯‘𝑅) + 1))⟶ℕ)
4238, 41sylib 210 . . . . . . . . . . . . . . . . . . . . . . . . 25 (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) → 𝑑:(1...((♯‘𝑅) + 1))⟶ℕ)
4342ffvelrnda 6670 . . . . . . . . . . . . . . . . . . . . . . . 24 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) → (𝑑𝑖) ∈ ℕ)
4437, 43nnaddcld 11485 . . . . . . . . . . . . . . . . . . . . . . 23 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) → (𝑎 + (𝑑𝑖)) ∈ ℕ)
45 vdwapid1 16157 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝐾 ∈ ℕ ∧ (𝑎 + (𝑑𝑖)) ∈ ℕ ∧ (𝑑𝑖) ∈ ℕ) → (𝑎 + (𝑑𝑖)) ∈ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)))
4636, 44, 43, 45syl3anc 1351 . . . . . . . . . . . . . . . . . . . . . 22 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) → (𝑎 + (𝑑𝑖)) ∈ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)))
4746adantr 473 . . . . . . . . . . . . . . . . . . . . 21 (((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) ∧ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → (𝑎 + (𝑑𝑖)) ∈ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)))
4835, 47sseldd 3855 . . . . . . . . . . . . . . . . . . . 20 (((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) ∧ ((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → (𝑎 + (𝑑𝑖)) ∈ (1...𝑛))
4948ex 405 . . . . . . . . . . . . . . . . . . 19 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) → (((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))}) → (𝑎 + (𝑑𝑖)) ∈ (1...𝑛)))
50 ffvelrn 6668 . . . . . . . . . . . . . . . . . . 19 ((𝑓:(1...𝑛)⟶𝑅 ∧ (𝑎 + (𝑑𝑖)) ∈ (1...𝑛)) → (𝑓‘(𝑎 + (𝑑𝑖))) ∈ 𝑅)
5130, 49, 50syl6an 671 . . . . . . . . . . . . . . . . . 18 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ 𝑖 ∈ (1...((♯‘𝑅) + 1))) → (((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))}) → (𝑓‘(𝑎 + (𝑑𝑖))) ∈ 𝑅))
5251ralimdva 3121 . . . . . . . . . . . . . . . . 17 (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) → (∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))}) → ∀𝑖 ∈ (1...((♯‘𝑅) + 1))(𝑓‘(𝑎 + (𝑑𝑖))) ∈ 𝑅))
5352imp 398 . . . . . . . . . . . . . . . 16 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ∀𝑖 ∈ (1...((♯‘𝑅) + 1))(𝑓‘(𝑎 + (𝑑𝑖))) ∈ 𝑅)
54 eqid 2772 . . . . . . . . . . . . . . . . 17 (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) = (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))
5554fmpt 6691 . . . . . . . . . . . . . . . 16 (∀𝑖 ∈ (1...((♯‘𝑅) + 1))(𝑓‘(𝑎 + (𝑑𝑖))) ∈ 𝑅 ↔ (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))):(1...((♯‘𝑅) + 1))⟶𝑅)
5653, 55sylib 210 . . . . . . . . . . . . . . 15 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))):(1...((♯‘𝑅) + 1))⟶𝑅)
5756frnd 6345 . . . . . . . . . . . . . 14 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) ⊆ 𝑅)
58 ssdomg 8344 . . . . . . . . . . . . . 14 (𝑅 ∈ Fin → (ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) ⊆ 𝑅 → ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) ≼ 𝑅))
5929, 57, 58sylc 65 . . . . . . . . . . . . 13 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) ≼ 𝑅)
6029, 57ssfid 8528 . . . . . . . . . . . . . 14 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) ∈ Fin)
61 hashdom 13546 . . . . . . . . . . . . . 14 ((ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) ∈ Fin ∧ 𝑅 ∈ Fin) → ((♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) ≤ (♯‘𝑅) ↔ ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) ≼ 𝑅))
6260, 29, 61syl2anc 576 . . . . . . . . . . . . 13 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ((♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) ≤ (♯‘𝑅) ↔ ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖)))) ≼ 𝑅))
6359, 62mpbird 249 . . . . . . . . . . . 12 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → (♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) ≤ (♯‘𝑅))
64 breq1 4926 . . . . . . . . . . . 12 ((♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) = ((♯‘𝑅) + 1) → ((♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) ≤ (♯‘𝑅) ↔ ((♯‘𝑅) + 1) ≤ (♯‘𝑅)))
6563, 64syl5ibcom 237 . . . . . . . . . . 11 ((((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) ∧ ∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))})) → ((♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) = ((♯‘𝑅) + 1) → ((♯‘𝑅) + 1) ≤ (♯‘𝑅)))
6665expimpd 446 . . . . . . . . . 10 (((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) ∧ (𝑎 ∈ ℕ ∧ 𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1))))) → ((∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))}) ∧ (♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) = ((♯‘𝑅) + 1)) → ((♯‘𝑅) + 1) ≤ (♯‘𝑅)))
6766rexlimdvva 3233 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → (∃𝑎 ∈ ℕ ∃𝑑 ∈ (ℕ ↑𝑚 (1...((♯‘𝑅) + 1)))(∀𝑖 ∈ (1...((♯‘𝑅) + 1))((𝑎 + (𝑑𝑖))(AP‘𝐾)(𝑑𝑖)) ⊆ (𝑓 “ {(𝑓‘(𝑎 + (𝑑𝑖)))}) ∧ (♯‘ran (𝑖 ∈ (1...((♯‘𝑅) + 1)) ↦ (𝑓‘(𝑎 + (𝑑𝑖))))) = ((♯‘𝑅) + 1)) → ((♯‘𝑅) + 1) ≤ (♯‘𝑅)))
6828, 67sylbid 232 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → (⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 → ((♯‘𝑅) + 1) ≤ (♯‘𝑅)))
6920, 68mtod 190 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → ¬ ⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓)
70 biorf 920 . . . . . . 7 (¬ ⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 → ((𝐾 + 1) MonoAP 𝑓 ↔ (⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 ∨ (𝐾 + 1) MonoAP 𝑓)))
7169, 70syl 17 . . . . . 6 ((𝜑 ∧ (𝑛 ∈ ℕ ∧ 𝑓:(1...𝑛)⟶𝑅)) → ((𝐾 + 1) MonoAP 𝑓 ↔ (⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 ∨ (𝐾 + 1) MonoAP 𝑓)))
7271anassrs 460 . . . . 5 (((𝜑𝑛 ∈ ℕ) ∧ 𝑓:(1...𝑛)⟶𝑅) → ((𝐾 + 1) MonoAP 𝑓 ↔ (⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 ∨ (𝐾 + 1) MonoAP 𝑓)))
7313, 72syldan 582 . . . 4 (((𝜑𝑛 ∈ ℕ) ∧ 𝑓 ∈ (𝑅𝑚 (1...𝑛))) → ((𝐾 + 1) MonoAP 𝑓 ↔ (⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 ∨ (𝐾 + 1) MonoAP 𝑓)))
7473ralbidva 3140 . . 3 ((𝜑𝑛 ∈ ℕ) → (∀𝑓 ∈ (𝑅𝑚 (1...𝑛))(𝐾 + 1) MonoAP 𝑓 ↔ ∀𝑓 ∈ (𝑅𝑚 (1...𝑛))(⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 ∨ (𝐾 + 1) MonoAP 𝑓)))
7574rexbidva 3235 . 2 (𝜑 → (∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅𝑚 (1...𝑛))(𝐾 + 1) MonoAP 𝑓 ↔ ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅𝑚 (1...𝑛))(⟨((♯‘𝑅) + 1), 𝐾⟩ PolyAP 𝑓 ∨ (𝐾 + 1) MonoAP 𝑓)))
768, 75mpbird 249 1 (𝜑 → ∃𝑛 ∈ ℕ ∀𝑓 ∈ (𝑅𝑚 (1...𝑛))(𝐾 + 1) MonoAP 𝑓)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 387  wo 833   = wceq 1507  wcel 2048  wral 3082  wrex 3083  Vcvv 3409  wss 3825  {csn 4435  cop 4441   class class class wbr 4923  cmpt 5002  ccnv 5399  dom cdm 5400  ran crn 5401  cima 5403  wf 6178  cfv 6182  (class class class)co 6970  𝑚 cmap 8198  cdom 8296  Fincfn 8298  cr 10326  1c1 10328   + caddc 10330   < clt 10466  cle 10467  cn 11431  2c2 11488  0cn0 11700  cuz 12051  ...cfz 12701  chash 13498  APcvdwa 16147   MonoAP cvdwm 16148   PolyAP cvdwp 16149
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-13 2299  ax-ext 2745  ax-rep 5043  ax-sep 5054  ax-nul 5061  ax-pow 5113  ax-pr 5180  ax-un 7273  ax-cnex 10383  ax-resscn 10384  ax-1cn 10385  ax-icn 10386  ax-addcl 10387  ax-addrcl 10388  ax-mulcl 10389  ax-mulrcl 10390  ax-mulcom 10391  ax-addass 10392  ax-mulass 10393  ax-distr 10394  ax-i2m1 10395  ax-1ne0 10396  ax-1rid 10397  ax-rnegex 10398  ax-rrecex 10399  ax-cnre 10400  ax-pre-lttri 10401  ax-pre-lttrn 10402  ax-pre-ltadd 10403  ax-pre-mulgt0 10404
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3or 1069  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2014  df-mo 2544  df-eu 2580  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-ne 2962  df-nel 3068  df-ral 3087  df-rex 3088  df-reu 3089  df-rmo 3090  df-rab 3091  df-v 3411  df-sbc 3678  df-csb 3783  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-pss 3841  df-nul 4174  df-if 4345  df-pw 4418  df-sn 4436  df-pr 4438  df-tp 4440  df-op 4442  df-uni 4707  df-int 4744  df-iun 4788  df-br 4924  df-opab 4986  df-mpt 5003  df-tr 5025  df-id 5305  df-eprel 5310  df-po 5319  df-so 5320  df-fr 5359  df-we 5361  df-xp 5406  df-rel 5407  df-cnv 5408  df-co 5409  df-dm 5410  df-rn 5411  df-res 5412  df-ima 5413  df-pred 5980  df-ord 6026  df-on 6027  df-lim 6028  df-suc 6029  df-iota 6146  df-fun 6184  df-fn 6185  df-f 6186  df-f1 6187  df-fo 6188  df-f1o 6189  df-fv 6190  df-riota 6931  df-ov 6973  df-oprab 6974  df-mpo 6975  df-om 7391  df-1st 7494  df-2nd 7495  df-wrecs 7743  df-recs 7805  df-rdg 7843  df-1o 7897  df-2o 7898  df-oadd 7901  df-er 8081  df-map 8200  df-pm 8201  df-en 8299  df-dom 8300  df-sdom 8301  df-fin 8302  df-dju 9116  df-card 9154  df-pnf 10468  df-mnf 10469  df-xr 10470  df-ltxr 10471  df-le 10472  df-sub 10664  df-neg 10665  df-nn 11432  df-2 11496  df-n0 11701  df-xnn0 11773  df-z 11787  df-uz 12052  df-rp 12198  df-fz 12702  df-hash 13499  df-vdwap 16150  df-vdwmc 16151  df-vdwpc 16152
This theorem is referenced by:  vdwlem13  16175
  Copyright terms: Public domain W3C validator