Theorem erdszelem7 34257

Description: Lemma for erdsze 34262. (Contributed by Mario Carneiro, 22-Jan-2015.)

Hypotheses

Ref	Expression
erdsze.n	⊢ (𝜑 → 𝑁 ∈ ℕ)
erdsze.f	⊢ (𝜑 → 𝐹:(1...𝑁)–1-1→ℝ)
erdszelem.k	⊢ 𝐾 = (𝑥 ∈ (1...𝑁) ↦ sup((♯ “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝑥 ∈ 𝑦)}), ℝ, < ))
erdszelem.o	⊢ 𝑂 Or ℝ
erdszelem.a	⊢ (𝜑 → 𝐴 ∈ (1...𝑁))
erdszelem7.r	⊢ (𝜑 → 𝑅 ∈ ℕ)
erdszelem7.m	⊢ (𝜑 → ¬ (𝐾‘𝐴) ∈ (1...(𝑅 − 1)))

Assertion

Ref	Expression
erdszelem7	⊢ (𝜑 → ∃𝑠 ∈ 𝒫 (1...𝑁)(𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))

Distinct variable groups:   𝑥,𝑦,𝑠,𝐹   𝐾,𝑠   𝐴,𝑠,𝑥,𝑦   𝑂,𝑠,𝑥,𝑦   𝑅,𝑠,𝑥,𝑦   𝑁,𝑠,𝑥,𝑦   𝜑,𝑠,𝑥,𝑦

Allowed substitution hints:   𝐾(𝑥,𝑦)

Proof of Theorem erdszelem7

Step	Hyp	Ref	Expression
1		hashf 14300	. . . 4 ⊢ ♯:V⟶(ℕ0 ∪ {+∞})
2		ffun 6720	. . . 4 ⊢ (♯:V⟶(ℕ0 ∪ {+∞}) → Fun ♯)
3	1, 2	ax-mp 5	. . 3 ⊢ Fun ♯
4		erdszelem.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ (1...𝑁))
5		erdsze.n	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ)
6		erdsze.f	. . . . 5 ⊢ (𝜑 → 𝐹:(1...𝑁)–1-1→ℝ)
7		erdszelem.k	. . . . 5 ⊢ 𝐾 = (𝑥 ∈ (1...𝑁) ↦ sup((♯ “ {𝑦 ∈ 𝒫 (1...𝑥) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝑥 ∈ 𝑦)}), ℝ, < ))
8		erdszelem.o	. . . . 5 ⊢ 𝑂 Or ℝ
9	5, 6, 7, 8	erdszelem5 34255	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (1...𝑁)) → (𝐾‘𝐴) ∈ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}))
10	4, 9	mpdan 685	. . 3 ⊢ (𝜑 → (𝐾‘𝐴) ∈ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}))
11		fvelima 6957	. . 3 ⊢ ((Fun ♯ ∧ (𝐾‘𝐴) ∈ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)})) → ∃𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} (♯‘𝑠) = (𝐾‘𝐴))
12	3, 10, 11	sylancr 587	. 2 ⊢ (𝜑 → ∃𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} (♯‘𝑠) = (𝐾‘𝐴))
13		eqid 2732	. . . . . 6 ⊢ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} = {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}
14	13	erdszelem1 34251	. . . . 5 ⊢ (𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} ↔ (𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠))
15		simprl1 1218	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑠 ⊆ (1...𝐴))
16		elfzuz3 13500	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (1...𝑁) → 𝑁 ∈ (ℤ≥‘𝐴))
17		fzss2 13543	. . . . . . . . . . 11 ⊢ (𝑁 ∈ (ℤ≥‘𝐴) → (1...𝐴) ⊆ (1...𝑁))
18	4, 16, 17	3syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (1...𝐴) ⊆ (1...𝑁))
19	18	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → (1...𝐴) ⊆ (1...𝑁))
20	15, 19	sstrd 3992	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑠 ⊆ (1...𝑁))
21		velpw 4607	. . . . . . . 8 ⊢ (𝑠 ∈ 𝒫 (1...𝑁) ↔ 𝑠 ⊆ (1...𝑁))
22	20, 21	sylibr 233	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑠 ∈ 𝒫 (1...𝑁))
23		erdszelem7.m	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ (𝐾‘𝐴) ∈ (1...(𝑅 − 1)))
24	5, 6, 7, 8	erdszelem6 34256	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾:(1...𝑁)⟶ℕ)
25	24, 4	ffvelcdmd 7087	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐾‘𝐴) ∈ ℕ)
26		nnuz 12867	. . . . . . . . . . . . . 14 ⊢ ℕ = (ℤ≥‘1)
27	25, 26	eleqtrdi 2843	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐾‘𝐴) ∈ (ℤ≥‘1))
28		erdszelem7.r	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑅 ∈ ℕ)
29		nnz 12581	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ ℕ → 𝑅 ∈ ℤ)
30		peano2zm 12607	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ ℤ → (𝑅 − 1) ∈ ℤ)
31	28, 29, 30	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑅 − 1) ∈ ℤ)
32		elfz5 13495	. . . . . . . . . . . . 13 ⊢ (((𝐾‘𝐴) ∈ (ℤ≥‘1) ∧ (𝑅 − 1) ∈ ℤ) → ((𝐾‘𝐴) ∈ (1...(𝑅 − 1)) ↔ (𝐾‘𝐴) ≤ (𝑅 − 1)))
33	27, 31, 32	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐾‘𝐴) ∈ (1...(𝑅 − 1)) ↔ (𝐾‘𝐴) ≤ (𝑅 − 1)))
34		nnltlem1 12631	. . . . . . . . . . . . 13 ⊢ (((𝐾‘𝐴) ∈ ℕ ∧ 𝑅 ∈ ℕ) → ((𝐾‘𝐴) < 𝑅 ↔ (𝐾‘𝐴) ≤ (𝑅 − 1)))
35	25, 28, 34	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐾‘𝐴) < 𝑅 ↔ (𝐾‘𝐴) ≤ (𝑅 − 1)))
36	33, 35	bitr4d 281	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐾‘𝐴) ∈ (1...(𝑅 − 1)) ↔ (𝐾‘𝐴) < 𝑅))
37	23, 36	mtbid 323	. . . . . . . . . 10 ⊢ (𝜑 → ¬ (𝐾‘𝐴) < 𝑅)
38	28	nnred 12229	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℝ)
39	13	erdszelem2 34252	. . . . . . . . . . . . . 14 ⊢ ((♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) ∈ Fin ∧ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) ⊆ ℕ)
40	39	simpri 486	. . . . . . . . . . . . 13 ⊢ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) ⊆ ℕ
41		nnssre 12218	. . . . . . . . . . . . 13 ⊢ ℕ ⊆ ℝ
42	40, 41	sstri 3991	. . . . . . . . . . . 12 ⊢ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) ⊆ ℝ
43	42, 10	sselid 3980	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐾‘𝐴) ∈ ℝ)
44	38, 43	lenltd 11362	. . . . . . . . . 10 ⊢ (𝜑 → (𝑅 ≤ (𝐾‘𝐴) ↔ ¬ (𝐾‘𝐴) < 𝑅))
45	37, 44	mpbird 256	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ≤ (𝐾‘𝐴))
46	45	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑅 ≤ (𝐾‘𝐴))
47		simprr 771	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → (♯‘𝑠) = (𝐾‘𝐴))
48	46, 47	breqtrrd 5176	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑅 ≤ (♯‘𝑠))
49		simprl2 1219	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)))
50	22, 48, 49	jca32 516	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → (𝑠 ∈ 𝒫 (1...𝑁) ∧ (𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)))))
51	50	expr 457	. . . . 5 ⊢ ((𝜑 ∧ (𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠)) → ((♯‘𝑠) = (𝐾‘𝐴) → (𝑠 ∈ 𝒫 (1...𝑁) ∧ (𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))))
52	14, 51	sylan2b 594	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) → ((♯‘𝑠) = (𝐾‘𝐴) → (𝑠 ∈ 𝒫 (1...𝑁) ∧ (𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))))
53	52	expimpd 454	. . 3 ⊢ (𝜑 → ((𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} ∧ (♯‘𝑠) = (𝐾‘𝐴)) → (𝑠 ∈ 𝒫 (1...𝑁) ∧ (𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))))
54	53	reximdv2 3164	. 2 ⊢ (𝜑 → (∃𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} (♯‘𝑠) = (𝐾‘𝐴) → ∃𝑠 ∈ 𝒫 (1...𝑁)(𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)))))
55	12, 54	mpd 15	1 ⊢ (𝜑 → ∃𝑠 ∈ 𝒫 (1...𝑁)(𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∃wrex 3070  {crab 3432  Vcvv 3474   ∪ cun 3946   ⊆ wss 3948  𝒫 cpw 4602  {csn 4628   class class class wbr 5148   ↦ cmpt 5231   Or wor 5587   ↾ cres 5678   “ cima 5679  Fun wfun 6537  ⟶wf 6539  –1-1→wf1 6540  ‘cfv 6543   Isom wiso 6544  (class class class)co 7411  Fincfn 8941  supcsup 9437  ℝcr 11111  1c1 11113  +∞cpnf 11247   < clt 11250   ≤ cle 11251   − cmin 11446  ℕcn 12214  ℕ₀cn0 12474  ℤcz 12560  ℤ_≥cuz 12824  ...cfz 13486  ♯chash 14292

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-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-rmo 3376  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-int 4951  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-isom 6552  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-1o 8468  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-fin 8945  df-sup 9439  df-card 9936  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-xnn0 12547  df-z 12561  df-uz 12825  df-fz 13487  df-hash 14293

This theorem is referenced by:  erdszelem11  34261