stoweidlem35 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > stoweidlem35		Structured version Visualization version GIF version

Theorem stoweidlem35 46848

Description: This lemma is used to prove the existence of a function p as in Lemma 1 of [BrosowskiDeutsh] p. 90: p is in the subalgebra, such that 0 <= p <= 1, p_(t₀) = 0, and p > 0 on T - U. Here (𝑞‘𝑖) is used to represent p_(t_i) in the paper. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

**Hypotheses**
Ref	Expression
stoweidlem35.1	⊢ Ⅎ𝑡𝜑
stoweidlem35.2	⊢ Ⅎ𝑤𝜑
stoweidlem35.3	⊢ Ⅎℎ𝜑
stoweidlem35.4	⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
stoweidlem35.5	⊢ 𝑊 = {𝑤 ∈ 𝐽 ∣ ∃ℎ ∈ 𝑄 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}
stoweidlem35.6	⊢ 𝐺 = (𝑤 ∈ 𝑋 ↦ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
stoweidlem35.7	⊢ (𝜑 → 𝐴 ∈ V)
stoweidlem35.8	⊢ (𝜑 → 𝑋 ∈ Fin)
stoweidlem35.9	⊢ (𝜑 → 𝑋 ⊆ 𝑊)
stoweidlem35.10	⊢ (𝜑 → (𝑇 ∖ 𝑈) ⊆ ∪ 𝑋)
stoweidlem35.11	⊢ (𝜑 → (𝑇 ∖ 𝑈) ≠ ∅)

**Assertion**
Ref	Expression
stoweidlem35	⊢ (𝜑 → ∃𝑚∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))))

Distinct variable groups: ℎ,𝑖,𝑡,𝑤 𝑖,𝑚,𝑞,𝑡 𝑖,𝐺 𝑤,𝑄 𝑇,ℎ,𝑤 𝑈,𝑞 𝜑,𝑖,𝑚 𝐴,ℎ,𝑡 ℎ,𝑋,𝑖,𝑡,𝑤 𝑤,𝑚 𝑚,𝐺 𝑄,𝑞 𝑇,𝑞 𝑡,𝑍 𝑤,𝑈 Allowed substitution hints: 𝜑(𝑤, 𝑡, ℎ, 𝑞) 𝐴(𝑤, 𝑖, 𝑚, 𝑞) 𝑄(𝑡, ℎ, 𝑖, 𝑚) 𝑇(𝑡, 𝑖, 𝑚) 𝑈(𝑡, ℎ, 𝑖, 𝑚) 𝐺(𝑤, 𝑡, ℎ, 𝑞) 𝐽(𝑤, 𝑡, ℎ, 𝑖, 𝑚, 𝑞) 𝑊(𝑤, 𝑡, ℎ, 𝑖, 𝑚, 𝑞) 𝑋(𝑚, 𝑞) 𝑍(𝑤, ℎ, 𝑖, 𝑚, 𝑞)

Proof of Theorem stoweidlem35 Dummy variables 𝑓 𝑔 𝑘 𝑙 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		stoweidlem35.8	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ Fin)
2		stoweidlem35.6	. . . . . . . . . . 11 ⊢ 𝐺 = (𝑤 ∈ 𝑋 ↦ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
3	2	rnmptfi 45988	. . . . . . . . . 10 ⊢ (𝑋 ∈ Fin → ran 𝐺 ∈ Fin)
4	1, 3	syl 18	. . . . . . . . 9 ⊢ (𝜑 → ran 𝐺 ∈ Fin)
5		fnchoice 45848	. . . . . . . . . . 11 ⊢ (ran 𝐺 ∈ Fin → ∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙)))
6	5	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ran 𝐺 ∈ Fin) → ∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙)))
7		simprl 783	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))) → 𝑔 Fn ran 𝐺)
8		stoweidlem35.2	. . . . . . . . . . . . . . . . . . . . 21 ⊢ Ⅎ𝑤𝜑
9		nfmpt1 5208	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ Ⅎ𝑤(𝑤 ∈ 𝑋 ↦ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
10	2, 9	nfcxfr 2922	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ Ⅎ𝑤𝐺
11	10	nfrn 5940	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑤ran 𝐺
12	11	nfcri 2916	. . . . . . . . . . . . . . . . . . . . 21 ⊢ Ⅎ𝑤 𝑘 ∈ ran 𝐺
13	8, 12	nfan 1932	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑤(𝜑 ∧ 𝑘 ∈ ran 𝐺)
14		stoweidlem35.9	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝜑 → 𝑋 ⊆ 𝑊)
15	14	sselda 3934	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑋) → 𝑤 ∈ 𝑊)
16		stoweidlem35.5	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ 𝑊 = {𝑤 ∈ 𝐽 ∣ ∃ℎ ∈ 𝑄 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}
17	15, 16	eleqtrdi 2872	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑋) → 𝑤 ∈ {𝑤 ∈ 𝐽 ∣ ∃ℎ ∈ 𝑄 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
18		rabid 3435	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑤 ∈ {𝑤 ∈ 𝐽 ∣ ∃ℎ ∈ 𝑄 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} ↔ (𝑤 ∈ 𝐽 ∧ ∃ℎ ∈ 𝑄 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}))
19	17, 18	sylib 221	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑋) → (𝑤 ∈ 𝐽 ∧ ∃ℎ ∈ 𝑄 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}))
20	19	simprd 501	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑋) → ∃ℎ ∈ 𝑄 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)})
21		df-rex 3089	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (∃ℎ ∈ 𝑄 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)} ↔ ∃ℎ(ℎ ∈ 𝑄 ∧ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}))
22	20, 21	sylib 221	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑋) → ∃ℎ(ℎ ∈ 𝑄 ∧ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}))
23		rabid 3435	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (ℎ ∈ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} ↔ (ℎ ∈ 𝑄 ∧ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}))
24	23	exbii 1881	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (∃ℎ ℎ ∈ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} ↔ ∃ℎ(ℎ ∈ 𝑄 ∧ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}))
25	22, 24	sylibr 237	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑋) → ∃ℎ ℎ ∈ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
26	25	adantr 486	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑋) ∧ 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}) → ∃ℎ ℎ ∈ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
27		stoweidlem35.3	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ Ⅎℎ𝜑
28		nfv 1947	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ Ⅎℎ 𝑤 ∈ 𝑋
29	27, 28	nfan 1932	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ Ⅎℎ(𝜑 ∧ 𝑤 ∈ 𝑋)
30		nfrab1 3434	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ Ⅎℎ{ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}
31	30	nfeq2 2941	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ Ⅎℎ 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}
32	29, 31	nfan 1932	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ Ⅎℎ((𝜑 ∧ 𝑤 ∈ 𝑋) ∧ 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
33		eleq2 2851	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} → (ℎ ∈ 𝑘 ↔ ℎ ∈ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}))
34	33	biimprd 251	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} → (ℎ ∈ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} → ℎ ∈ 𝑘))
35	34	adantl 487	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑋) ∧ 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}) → (ℎ ∈ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} → ℎ ∈ 𝑘))
36	32, 35	eximd 2254	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑋) ∧ 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}) → (∃ℎ ℎ ∈ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} → ∃ℎ ℎ ∈ 𝑘))
37	26, 36	mpd 16	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑋) ∧ 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}) → ∃ℎ ℎ ∈ 𝑘)
38	37	adantllr 732	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑘 ∈ ran 𝐺) ∧ 𝑤 ∈ 𝑋) ∧ 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}) → ∃ℎ ℎ ∈ 𝑘)
39	2	elrnmpt 5946	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑘 ∈ ran 𝐺 → (𝑘 ∈ ran 𝐺 ↔ ∃𝑤 ∈ 𝑋 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}))
40	39	ibi 270	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ ran 𝐺 → ∃𝑤 ∈ 𝑋 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
41	40	adantl 487	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ ran 𝐺) → ∃𝑤 ∈ 𝑋 𝑘 = {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
42	13, 38, 41	r19.29af 3273	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ ran 𝐺) → ∃ℎ ℎ ∈ 𝑘)
43		n0 4303	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ≠ ∅ ↔ ∃ℎ ℎ ∈ 𝑘)
44	42, 43	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ ran 𝐺) → 𝑘 ≠ ∅)
45	44	adantlr 728	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))) ∧ 𝑘 ∈ ran 𝐺) → 𝑘 ≠ ∅)
46		simplrr 790	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))) ∧ 𝑘 ∈ ran 𝐺) → ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))
47		neeq1 3019	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑙 = 𝑘 → (𝑙 ≠ ∅ ↔ 𝑘 ≠ ∅))
48		fveq2 6882	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑙 = 𝑘 → (𝑔‘𝑙) = (𝑔‘𝑘))
49	48	eleq1d 2847	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑙 = 𝑘 → ((𝑔‘𝑙) ∈ 𝑙 ↔ (𝑔‘𝑘) ∈ 𝑙))
50		eleq2 2851	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑙 = 𝑘 → ((𝑔‘𝑘) ∈ 𝑙 ↔ (𝑔‘𝑘) ∈ 𝑘))
51	49, 50	bitrd 282	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑙 = 𝑘 → ((𝑔‘𝑙) ∈ 𝑙 ↔ (𝑔‘𝑘) ∈ 𝑘))
52	47, 51	imbi12d 347	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑙 = 𝑘 → ((𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙) ↔ (𝑘 ≠ ∅ → (𝑔‘𝑘) ∈ 𝑘)))
53	52	rspccva 3578	. . . . . . . . . . . . . . . . . 18 ⊢ ((∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙) ∧ 𝑘 ∈ ran 𝐺) → (𝑘 ≠ ∅ → (𝑔‘𝑘) ∈ 𝑘))
54	46, 53	sylancom 600	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))) ∧ 𝑘 ∈ ran 𝐺) → (𝑘 ≠ ∅ → (𝑔‘𝑘) ∈ 𝑘))
55	45, 54	mpd 16	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))) ∧ 𝑘 ∈ ran 𝐺) → (𝑔‘𝑘) ∈ 𝑘)
56	55	ralrimiva 3156	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))) → ∀𝑘 ∈ ran 𝐺(𝑔‘𝑘) ∈ 𝑘)
57		fveq2 6882	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑙 → (𝑔‘𝑘) = (𝑔‘𝑙))
58	57	eleq1d 2847	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑙 → ((𝑔‘𝑘) ∈ 𝑘 ↔ (𝑔‘𝑙) ∈ 𝑘))
59		eleq2 2851	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑙 → ((𝑔‘𝑙) ∈ 𝑘 ↔ (𝑔‘𝑙) ∈ 𝑙))
60	58, 59	bitrd 282	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑙 → ((𝑔‘𝑘) ∈ 𝑘 ↔ (𝑔‘𝑙) ∈ 𝑙))
61	60	cbvralvw 3242	. . . . . . . . . . . . . . 15 ⊢ (∀𝑘 ∈ ran 𝐺(𝑔‘𝑘) ∈ 𝑘 ↔ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙)
62	56, 61	sylib 221	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))) → ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙)
63	7, 62	jca 521	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙))) → (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙))
64	63	ex 418	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙)) → (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙)))
65	64	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ran 𝐺 ∈ Fin) → ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙)) → (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙)))
66	65	eximdv 1950	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ran 𝐺 ∈ Fin) → (∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑙 ≠ ∅ → (𝑔‘𝑙) ∈ 𝑙)) → ∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙)))
67	6, 66	mpd 16	. . . . . . . . 9 ⊢ ((𝜑 ∧ ran 𝐺 ∈ Fin) → ∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙))
68	4, 67	mpdan 700	. . . . . . . 8 ⊢ (𝜑 → ∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙))
69	68	ralrimivw 3160	. . . . . . 7 ⊢ (𝜑 → ∀𝑚 ∈ ℕ ∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙))
70		stoweidlem35.10	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑇 ∖ 𝑈) ⊆ ∪ 𝑋)
71		stoweidlem35.11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑇 ∖ 𝑈) ≠ ∅)
72		ssn0 4358	. . . . . . . . . . . . 13 ⊢ (((𝑇 ∖ 𝑈) ⊆ ∪ 𝑋 ∧ (𝑇 ∖ 𝑈) ≠ ∅) → ∪ 𝑋 ≠ ∅)
73	70, 71, 72	syl2anc 596	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ 𝑋 ≠ ∅)
74	73	neneqd 2962	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ ∪ 𝑋 = ∅)
75		unieq 4881	. . . . . . . . . . . 12 ⊢ (𝑋 = ∅ → ∪ 𝑋 = ∪ ∅)
76		uni0 4899	. . . . . . . . . . . 12 ⊢ ∪ ∅ = ∅
77	75, 76	eqtrdi 2813	. . . . . . . . . . 11 ⊢ (𝑋 = ∅ → ∪ 𝑋 = ∅)
78	74, 77	nsyl 141	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑋 = ∅)
79		dm0rn0 5912	. . . . . . . . . . 11 ⊢ (dom 𝐺 = ∅ ↔ ran 𝐺 = ∅)
80		stoweidlem35.4	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
81		stoweidlem35.7	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ∈ V)
82	80, 81	rabexd 5308	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑄 ∈ V)
83		nfrab1 3434	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎℎ{ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
84	80, 83	nfcxfr 2922	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎℎ𝑄
85	84	rabexgf 45843	. . . . . . . . . . . . . . . . 17 ⊢ (𝑄 ∈ V → {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} ∈ V)
86	82, 85	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} ∈ V)
87	86	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑋) → {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}} ∈ V)
88	8, 87, 2	fmptdf 7113	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺:𝑋⟶V)
89		dffn2 6708	. . . . . . . . . . . . . 14 ⊢ (𝐺 Fn 𝑋 ↔ 𝐺:𝑋⟶V)
90	88, 89	sylibr 237	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 Fn 𝑋)
91	90	fndmd 6641	. . . . . . . . . . . 12 ⊢ (𝜑 → dom 𝐺 = 𝑋)
92	91	eqeq1d 2764	. . . . . . . . . . 11 ⊢ (𝜑 → (dom 𝐺 = ∅ ↔ 𝑋 = ∅))
93	79, 92	bitr3id 288	. . . . . . . . . 10 ⊢ (𝜑 → (ran 𝐺 = ∅ ↔ 𝑋 = ∅))
94	78, 93	mtbird 328	. . . . . . . . 9 ⊢ (𝜑 → ¬ ran 𝐺 = ∅)
95		fz1f1o 15796	. . . . . . . . . . 11 ⊢ (ran 𝐺 ∈ Fin → (ran 𝐺 = ∅ ∨ ((♯‘ran 𝐺) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘ran 𝐺))–1-1-onto→ran 𝐺)))
96	4, 95	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → (ran 𝐺 = ∅ ∨ ((♯‘ran 𝐺) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘ran 𝐺))–1-1-onto→ran 𝐺)))
97	96	ord 878	. . . . . . . . 9 ⊢ (𝜑 → (¬ ran 𝐺 = ∅ → ((♯‘ran 𝐺) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘ran 𝐺))–1-1-onto→ran 𝐺)))
98	94, 97	mpd 16	. . . . . . . 8 ⊢ (𝜑 → ((♯‘ran 𝐺) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘ran 𝐺))–1-1-onto→ran 𝐺))
99		oveq2 7424	. . . . . . . . . . 11 ⊢ (𝑚 = (♯‘ran 𝐺) → (1...𝑚) = (1...(♯‘ran 𝐺)))
100	99	f1oeq2d 6817	. . . . . . . . . 10 ⊢ (𝑚 = (♯‘ran 𝐺) → (𝑓:(1...𝑚)–1-1-onto→ran 𝐺 ↔ 𝑓:(1...(♯‘ran 𝐺))–1-1-onto→ran 𝐺))
101	100	exbidv 1954	. . . . . . . . 9 ⊢ (𝑚 = (♯‘ran 𝐺) → (∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺 ↔ ∃𝑓 𝑓:(1...(♯‘ran 𝐺))–1-1-onto→ran 𝐺))
102	101	rspcev 3579	. . . . . . . 8 ⊢ (((♯‘ran 𝐺) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘ran 𝐺))–1-1-onto→ran 𝐺) → ∃𝑚 ∈ ℕ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)
103	98, 102	syl 18	. . . . . . 7 ⊢ (𝜑 → ∃𝑚 ∈ ℕ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)
104		r19.29 3127	. . . . . . 7 ⊢ ((∀𝑚 ∈ ℕ ∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ ∃𝑚 ∈ ℕ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺) → ∃𝑚 ∈ ℕ (∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))
105	69, 103, 104	syl2anc 596	. . . . . 6 ⊢ (𝜑 → ∃𝑚 ∈ ℕ (∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))
106		exdistrv 1988	. . . . . . . . 9 ⊢ (∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺) ↔ (∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))
107	106	biimpri 231	. . . . . . . 8 ⊢ ((∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺) → ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))
108	107	a1i 11	. . . . . . 7 ⊢ (𝜑 → ((∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺) → ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
109	108	reximdv 3179	. . . . . 6 ⊢ (𝜑 → (∃𝑚 ∈ ℕ (∃𝑔(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ ∃𝑓 𝑓:(1...𝑚)–1-1-onto→ran 𝐺) → ∃𝑚 ∈ ℕ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
110	105, 109	mpd 16	. . . . 5 ⊢ (𝜑 → ∃𝑚 ∈ ℕ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))
111		df-rex 3089	. . . . 5 ⊢ (∃𝑚 ∈ ℕ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺) ↔ ∃𝑚(𝑚 ∈ ℕ ∧ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
112	110, 111	sylib 221	. . . 4 ⊢ (𝜑 → ∃𝑚(𝑚 ∈ ℕ ∧ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
113		ax-5 1943	. . . . . . . . 9 ⊢ (𝑚 ∈ ℕ → ∀𝑔 𝑚 ∈ ℕ)
114		19.29 1906	. . . . . . . . 9 ⊢ ((∀𝑔 𝑚 ∈ ℕ ∧ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑔(𝑚 ∈ ℕ ∧ ∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
115	113, 114	sylan 592	. . . . . . . 8 ⊢ ((𝑚 ∈ ℕ ∧ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑔(𝑚 ∈ ℕ ∧ ∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
116		ax-5 1943	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ → ∀𝑓 𝑚 ∈ ℕ)
117		19.29 1906	. . . . . . . . . 10 ⊢ ((∀𝑓 𝑚 ∈ ℕ ∧ ∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑓(𝑚 ∈ ℕ ∧ ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
118	116, 117	sylan 592	. . . . . . . . 9 ⊢ ((𝑚 ∈ ℕ ∧ ∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑓(𝑚 ∈ ℕ ∧ ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
119	118	eximi 1868	. . . . . . . 8 ⊢ (∃𝑔(𝑚 ∈ ℕ ∧ ∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
120	115, 119	syl 18	. . . . . . 7 ⊢ ((𝑚 ∈ ℕ ∧ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
121		df-3an 1105	. . . . . . . . 9 ⊢ ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺) ↔ ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))
122	121	anbi2i 635	. . . . . . . 8 ⊢ ((𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) ↔ (𝑚 ∈ ℕ ∧ ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
123	122	2exbii 1882	. . . . . . 7 ⊢ (∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) ↔ ∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ ((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
124	120, 123	sylibr 237	. . . . . 6 ⊢ ((𝑚 ∈ ℕ ∧ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
125	124	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝑚 ∈ ℕ ∧ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))))
126	125	eximdv 1950	. . . 4 ⊢ (𝜑 → (∃𝑚(𝑚 ∈ ℕ ∧ ∃𝑔∃𝑓((𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙) ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑚∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))))
127	112, 126	mpd 16	. . 3 ⊢ (𝜑 → ∃𝑚∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
128	82	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) → 𝑄 ∈ V)
129		simprl 783	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) → 𝑚 ∈ ℕ)
130		simprr1 1240	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) → 𝑔 Fn ran 𝐺)
131		elex 3474	. . . . . . . . 9 ⊢ (ran 𝐺 ∈ Fin → ran 𝐺 ∈ V)
132	4, 131	syl 18	. . . . . . . 8 ⊢ (𝜑 → ran 𝐺 ∈ V)
133	132	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) → ran 𝐺 ∈ V)
134		simprr2 1241	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) → ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙)
135	51	rspccva 3578	. . . . . . . 8 ⊢ ((∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑘 ∈ ran 𝐺) → (𝑔‘𝑘) ∈ 𝑘)
136	134, 135	sylan 592	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) ∧ 𝑘 ∈ ran 𝐺) → (𝑔‘𝑘) ∈ 𝑘)
137		simprr3 1242	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) → 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)
138	70	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) → (𝑇 ∖ 𝑈) ⊆ ∪ 𝑋)
139		stoweidlem35.1	. . . . . . . 8 ⊢ Ⅎ𝑡𝜑
140		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑡 𝑚 ∈ ℕ
141		nfcv 2924	. . . . . . . . . . 11 ⊢ Ⅎ𝑡𝑔
142		nfcv 2924	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑡𝑋
143		nfrab1 3434	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑡{𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}
144	143	nfeq2 2941	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑡 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}
145		nfv 1947	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑡(ℎ‘𝑍) = 0
146		nfra1 3288	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑡∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)
147	145, 146	nfan 1932	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑡((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))
148		nfcv 2924	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑡𝐴
149	147, 148	nfrabw 3450	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑡{ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
150	80, 149	nfcxfr 2922	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑡𝑄
151	144, 150	nfrabw 3450	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑡{ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}}
152	142, 151	nfmpt 5207	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑡(𝑤 ∈ 𝑋 ↦ {ℎ ∈ 𝑄 ∣ 𝑤 = {𝑡 ∈ 𝑇 ∣ 0 < (ℎ‘𝑡)}})
153	2, 152	nfcxfr 2922	. . . . . . . . . . . 12 ⊢ Ⅎ𝑡𝐺
154	153	nfrn 5940	. . . . . . . . . . 11 ⊢ Ⅎ𝑡ran 𝐺
155	141, 154	nffn 6635	. . . . . . . . . 10 ⊢ Ⅎ𝑡 𝑔 Fn ran 𝐺
156		nfv 1947	. . . . . . . . . . 11 ⊢ Ⅎ𝑡(𝑔‘𝑙) ∈ 𝑙
157	154, 156	nfralw 3311	. . . . . . . . . 10 ⊢ Ⅎ𝑡∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙
158		nfcv 2924	. . . . . . . . . . 11 ⊢ Ⅎ𝑡𝑓
159		nfcv 2924	. . . . . . . . . . 11 ⊢ Ⅎ𝑡(1...𝑚)
160	158, 159, 154	nff1o 6819	. . . . . . . . . 10 ⊢ Ⅎ𝑡 𝑓:(1...𝑚)–1-1-onto→ran 𝐺
161	155, 157, 160	nf3an 1934	. . . . . . . . 9 ⊢ Ⅎ𝑡(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)
162	140, 161	nfan 1932	. . . . . . . 8 ⊢ Ⅎ𝑡(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))
163	139, 162	nfan 1932	. . . . . . 7 ⊢ Ⅎ𝑡(𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
164		nfv 1947	. . . . . . . . 9 ⊢ Ⅎ𝑤 𝑚 ∈ ℕ
165		nfcv 2924	. . . . . . . . . . 11 ⊢ Ⅎ𝑤𝑔
166	165, 11	nffn 6635	. . . . . . . . . 10 ⊢ Ⅎ𝑤 𝑔 Fn ran 𝐺
167		nfv 1947	. . . . . . . . . . 11 ⊢ Ⅎ𝑤(𝑔‘𝑙) ∈ 𝑙
168	11, 167	nfralw 3311	. . . . . . . . . 10 ⊢ Ⅎ𝑤∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙
169		nfcv 2924	. . . . . . . . . . 11 ⊢ Ⅎ𝑤𝑓
170		nfcv 2924	. . . . . . . . . . 11 ⊢ Ⅎ𝑤(1...𝑚)
171	169, 170, 11	nff1o 6819	. . . . . . . . . 10 ⊢ Ⅎ𝑤 𝑓:(1...𝑚)–1-1-onto→ran 𝐺
172	166, 168, 171	nf3an 1934	. . . . . . . . 9 ⊢ Ⅎ𝑤(𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)
173	164, 172	nfan 1932	. . . . . . . 8 ⊢ Ⅎ𝑤(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))
174	8, 173	nfan 1932	. . . . . . 7 ⊢ Ⅎ𝑤(𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)))
175	2, 128, 129, 130, 133, 136, 137, 138, 163, 174, 84	stoweidlem27 46840	. . . . . 6 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺))) → ∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))))
176	175	ex 418	. . . . 5 ⊢ (𝜑 → ((𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡)))))
177	176	2eximdv 1952	. . . 4 ⊢ (𝜑 → (∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑔∃𝑓∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡)))))
178	177	eximdv 1950	. . 3 ⊢ (𝜑 → (∃𝑚∃𝑔∃𝑓(𝑚 ∈ ℕ ∧ (𝑔 Fn ran 𝐺 ∧ ∀𝑙 ∈ ran 𝐺(𝑔‘𝑙) ∈ 𝑙 ∧ 𝑓:(1...𝑚)–1-1-onto→ran 𝐺)) → ∃𝑚∃𝑔∃𝑓∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡)))))
179	127, 178	mpd 16	. 2 ⊢ (𝜑 → ∃𝑚∃𝑔∃𝑓∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))))
180		id 23	. . . 4 ⊢ (∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))) → ∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))))
181	180	exlimivv 1965	. . 3 ⊢ (∃𝑔∃𝑓∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))) → ∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))))
182	181	eximi 1868	. 2 ⊢ (∃𝑚∃𝑔∃𝑓∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))) → ∃𝑚∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))))
183	179, 182	syl 18	1 ⊢ (𝜑 → ∃𝑚∃𝑞(𝑚 ∈ ℕ ∧ (𝑞:(1...𝑚)⟶𝑄 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)∃𝑖 ∈ (1...𝑚)0 < ((𝑞‘𝑖)‘𝑡))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 ∀wal 1568 = wceq 1570 ∃wex 1812 Ⅎwnf 1816 ∈ wcel 2145 ≠ wne 2957 ∀wral 3078 ∃wrex 3088 {crab 3414 Vcvv 3453 ∖ cdif 3899 ⊆ wss 3902 ∅c0 4282 ∪ cuni 4870 class class class wbr 5107 ↦ cmpt 5190 dom cdm 5659 ran crn 5660 Fn wfn 6532 ⟶wf 6533 –1-1-onto→wf1o 6536 ‘cfv 6537 (class class class)co 7416 Fincfn 8955 0cc0 11125 1c1 11126 < clt 11268 ≤ cle 11269 ℕcn 12258 ...cfz 13561 ♯chash 14394

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-card 9947 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-n0 12530 df-z 12617 df-uz 12889 df-fz 13562 df-hash 14395

This theorem is used by: stoweidlem53 46866

W3C validator