erdszelem7 - Mathbox for Mario Carneiro

	Mathbox for Mario Carneiro		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > erdszelem7		Structured version Visualization version GIF version

Theorem erdszelem7 35393

Description: Lemma for erdsze 35398. (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 14265	. . . 4 ⊢ ♯:V⟶(ℕ₀ ∪ {+∞})
2		ffun 6666	. . . 4 ⊢ (♯:V⟶(ℕ₀ ∪ {+∞}) → 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 35391	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ (1...𝑁)) → (𝐾‘𝐴) ∈ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}))
10	4, 9	mpdan 688	. . 3 ⊢ (𝜑 → (𝐾‘𝐴) ∈ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}))
11		fvelima 6900	. . 3 ⊢ ((Fun ♯ ∧ (𝐾‘𝐴) ∈ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)})) → ∃𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} (♯‘𝑠) = (𝐾‘𝐴))
12	3, 10, 11	sylancr 588	. 2 ⊢ (𝜑 → ∃𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} (♯‘𝑠) = (𝐾‘𝐴))
13		eqid 2737	. . . . . 6 ⊢ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} = {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}
14	13	erdszelem1 35387	. . . . 5 ⊢ (𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} ↔ (𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠))
15		simprl1 1220	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑠 ⊆ (1...𝐴))
16		elfzuz3 13441	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (1...𝑁) → 𝑁 ∈ (ℤ_≥‘𝐴))
17		fzss2 13484	. . . . . . . . . . 11 ⊢ (𝑁 ∈ (ℤ_≥‘𝐴) → (1...𝐴) ⊆ (1...𝑁))
18	4, 16, 17	3syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (1...𝐴) ⊆ (1...𝑁))
19	18	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → (1...𝐴) ⊆ (1...𝑁))
20	15, 19	sstrd 3945	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑠 ⊆ (1...𝑁))
21		velpw 4560	. . . . . . . 8 ⊢ (𝑠 ∈ 𝒫 (1...𝑁) ↔ 𝑠 ⊆ (1...𝑁))
22	20, 21	sylibr 234	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑠 ∈ 𝒫 (1...𝑁))
23		erdszelem7.m	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ (𝐾‘𝐴) ∈ (1...(𝑅 − 1)))
24	5, 6, 7, 8	erdszelem6 35392	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐾:(1...𝑁)⟶ℕ)
25	24, 4	ffvelcdmd 7032	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐾‘𝐴) ∈ ℕ)
26		nnuz 12794	. . . . . . . . . . . . . 14 ⊢ ℕ = (ℤ_≥‘1)
27	25, 26	eleqtrdi 2847	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐾‘𝐴) ∈ (ℤ_≥‘1))
28		erdszelem7.r	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑅 ∈ ℕ)
29		nnz 12513	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ ℕ → 𝑅 ∈ ℤ)
30		peano2zm 12538	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ ℤ → (𝑅 − 1) ∈ ℤ)
31	28, 29, 30	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑅 − 1) ∈ ℤ)
32		elfz5 13436	. . . . . . . . . . . . 13 ⊢ (((𝐾‘𝐴) ∈ (ℤ_≥‘1) ∧ (𝑅 − 1) ∈ ℤ) → ((𝐾‘𝐴) ∈ (1...(𝑅 − 1)) ↔ (𝐾‘𝐴) ≤ (𝑅 − 1)))
33	27, 31, 32	syl2anc 585	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐾‘𝐴) ∈ (1...(𝑅 − 1)) ↔ (𝐾‘𝐴) ≤ (𝑅 − 1)))
34		nnltlem1 12563	. . . . . . . . . . . . 13 ⊢ (((𝐾‘𝐴) ∈ ℕ ∧ 𝑅 ∈ ℕ) → ((𝐾‘𝐴) < 𝑅 ↔ (𝐾‘𝐴) ≤ (𝑅 − 1)))
35	25, 28, 34	syl2anc 585	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐾‘𝐴) < 𝑅 ↔ (𝐾‘𝐴) ≤ (𝑅 − 1)))
36	33, 35	bitr4d 282	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐾‘𝐴) ∈ (1...(𝑅 − 1)) ↔ (𝐾‘𝐴) < 𝑅))
37	23, 36	mtbid 324	. . . . . . . . . 10 ⊢ (𝜑 → ¬ (𝐾‘𝐴) < 𝑅)
38	28	nnred 12164	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 ∈ ℝ)
39	13	erdszelem2 35388	. . . . . . . . . . . . . 14 ⊢ ((♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) ∈ Fin ∧ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) ⊆ ℕ)
40	39	simpri 485	. . . . . . . . . . . . 13 ⊢ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) ⊆ ℕ
41		nnssre 12153	. . . . . . . . . . . . 13 ⊢ ℕ ⊆ ℝ
42	40, 41	sstri 3944	. . . . . . . . . . . 12 ⊢ (♯ “ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) ⊆ ℝ
43	42, 10	sselid 3932	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐾‘𝐴) ∈ ℝ)
44	38, 43	lenltd 11283	. . . . . . . . . 10 ⊢ (𝜑 → (𝑅 ≤ (𝐾‘𝐴) ↔ ¬ (𝐾‘𝐴) < 𝑅))
45	37, 44	mpbird 257	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ≤ (𝐾‘𝐴))
46	45	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑅 ≤ (𝐾‘𝐴))
47		simprr 773	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → (♯‘𝑠) = (𝐾‘𝐴))
48	46, 47	breqtrrd 5127	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → 𝑅 ≤ (♯‘𝑠))
49		simprl2 1221	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)))
50	22, 48, 49	jca32 515	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠) ∧ (♯‘𝑠) = (𝐾‘𝐴))) → (𝑠 ∈ 𝒫 (1...𝑁) ∧ (𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)))))
51	50	expr 456	. . . . 5 ⊢ ((𝜑 ∧ (𝑠 ⊆ (1...𝐴) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)) ∧ 𝐴 ∈ 𝑠)) → ((♯‘𝑠) = (𝐾‘𝐴) → (𝑠 ∈ 𝒫 (1...𝑁) ∧ (𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))))
52	14, 51	sylan2b 595	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)}) → ((♯‘𝑠) = (𝐾‘𝐴) → (𝑠 ∈ 𝒫 (1...𝑁) ∧ (𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))))
53	52	expimpd 453	. . 3 ⊢ (𝜑 → ((𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} ∧ (♯‘𝑠) = (𝐾‘𝐴)) → (𝑠 ∈ 𝒫 (1...𝑁) ∧ (𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))))
54	53	reximdv2 3147	. 2 ⊢ (𝜑 → (∃𝑠 ∈ {𝑦 ∈ 𝒫 (1...𝐴) ∣ ((𝐹 ↾ 𝑦) Isom < , 𝑂 (𝑦, (𝐹 “ 𝑦)) ∧ 𝐴 ∈ 𝑦)} (♯‘𝑠) = (𝐾‘𝐴) → ∃𝑠 ∈ 𝒫 (1...𝑁)(𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠)))))
55	12, 54	mpd 15	1 ⊢ (𝜑 → ∃𝑠 ∈ 𝒫 (1...𝑁)(𝑅 ≤ (♯‘𝑠) ∧ (𝐹 ↾ 𝑠) Isom < , 𝑂 (𝑠, (𝐹 “ 𝑠))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 {crab 3400 Vcvv 3441 ∪ cun 3900 ⊆ wss 3902 𝒫 cpw 4555 {csn 4581 class class class wbr 5099 ↦ cmpt 5180 Or wor 5532 ↾ cres 5627 “ cima 5628 Fun wfun 6487 ⟶wf 6489 –1-1→wf1 6490 ‘cfv 6493 Isom wiso 6494 (class class class)co 7360 Fincfn 8887 supcsup 9347 ℝcr 11029 1c1 11031 +∞cpnf 11167 < clt 11170 ≤ cle 11171 − cmin 11368 ℕcn 12149 ℕ₀cn0 12405 ℤcz 12492 ℤ_≥cuz 12755 ...cfz 13427 ♯chash 14257

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-n0 12406 df-xnn0 12479 df-z 12493 df-uz 12756 df-fz 13428 df-hash 14258

This theorem is referenced by: erdszelem11 35397

W3C validator