Theorem heiborlem10 37844

Description: Lemma for heibor 37845. The last remaining piece of the proof is to find an element 𝐶 such that 𝐶𝐺0, i.e. 𝐶 is an element of (𝐹‘0) that has no finite subcover, which is true by heiborlem1 37835, since (𝐹‘0) is a finite cover of 𝑋, which has no finite subcover. Thus, the rest of the proof follows to a contradiction, and thus there must be a finite subcover of 𝑈 that covers 𝑋, i.e. 𝑋 is compact. (Contributed by Jeff Madsen, 22-Jan-2014.)

Hypotheses

Ref	Expression
heibor.1	⊢ 𝐽 = (MetOpen‘𝐷)
heibor.3	⊢ 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣}
heibor.4	⊢ 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
heibor.5	⊢ 𝐵 = (𝑧 ∈ 𝑋, 𝑚 ∈ ℕ0 ↦ (𝑧(ball‘𝐷)(1 / (2↑𝑚))))
heibor.6	⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
heibor.7	⊢ (𝜑 → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin))
heibor.8	⊢ (𝜑 → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛))

Assertion

Ref	Expression
heiborlem10	⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)∪ 𝐽 = ∪ 𝑣)

Distinct variable groups:   𝑦,𝑛,𝑢,𝐹   𝑚,𝑛,𝑢,𝑣,𝑦,𝑧,𝐷   𝐵,𝑛,𝑢,𝑣,𝑦   𝑚,𝐽,𝑛,𝑢,𝑣,𝑦,𝑧   𝑈,𝑛,𝑢,𝑣,𝑦,𝑧   𝑚,𝑋,𝑛,𝑢,𝑣,𝑦,𝑧   𝑛,𝐾,𝑦,𝑧   𝜑,𝑣

Allowed substitution hints:   𝜑(𝑦,𝑧,𝑢,𝑚,𝑛)   𝐵(𝑧,𝑚)   𝑈(𝑚)   𝐹(𝑧,𝑣,𝑚)   𝐺(𝑦,𝑧,𝑣,𝑢,𝑚,𝑛)   𝐾(𝑣,𝑢,𝑚)

Proof of Theorem heiborlem10

Dummy variables 𝑡 𝑥 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		heibor.7	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin))
2		0nn0 12516	. . . . . . . 8 ⊢ 0 ∈ ℕ0
3		inss2 4213	. . . . . . . . 9 ⊢ (𝒫 𝑋 ∩ Fin) ⊆ Fin
4		ffvelcdm 7071	. . . . . . . . 9 ⊢ ((𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin) ∧ 0 ∈ ℕ0) → (𝐹‘0) ∈ (𝒫 𝑋 ∩ Fin))
5	3, 4	sselid 3956	. . . . . . . 8 ⊢ ((𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin) ∧ 0 ∈ ℕ0) → (𝐹‘0) ∈ Fin)
6	1, 2, 5	sylancl 586	. . . . . . 7 ⊢ (𝜑 → (𝐹‘0) ∈ Fin)
7		heibor.8	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛))
8		fveq2 6876	. . . . . . . . . . . 12 ⊢ (𝑛 = 0 → (𝐹‘𝑛) = (𝐹‘0))
9		oveq2 7413	. . . . . . . . . . . 12 ⊢ (𝑛 = 0 → (𝑦𝐵𝑛) = (𝑦𝐵0))
10	8, 9	iuneq12d 4997	. . . . . . . . . . 11 ⊢ (𝑛 = 0 → ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛) = ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0))
11	10	eqeq2d 2746	. . . . . . . . . 10 ⊢ (𝑛 = 0 → (𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛) ↔ 𝑋 = ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0)))
12	11	rspccva 3600	. . . . . . . . 9 ⊢ ((∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛) ∧ 0 ∈ ℕ0) → 𝑋 = ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0))
13	7, 2, 12	sylancl 586	. . . . . . . 8 ⊢ (𝜑 → 𝑋 = ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0))
14		eqimss 4017	. . . . . . . 8 ⊢ (𝑋 = ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0) → 𝑋 ⊆ ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0))
15	13, 14	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑋 ⊆ ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0))
16		heibor.1	. . . . . . . . . 10 ⊢ 𝐽 = (MetOpen‘𝐷)
17		heibor.3	. . . . . . . . . 10 ⊢ 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣}
18		ovex 7438	. . . . . . . . . 10 ⊢ (𝑦𝐵0) ∈ V
19	16, 17, 18	heiborlem1 37835	. . . . . . . . 9 ⊢ (((𝐹‘0) ∈ Fin ∧ 𝑋 ⊆ ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0) ∧ 𝑋 ∈ 𝐾) → ∃𝑦 ∈ (𝐹‘0)(𝑦𝐵0) ∈ 𝐾)
20		oveq1 7412	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → (𝑦𝐵0) = (𝑥𝐵0))
21	20	eleq1d 2819	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ((𝑦𝐵0) ∈ 𝐾 ↔ (𝑥𝐵0) ∈ 𝐾))
22	21	cbvrexvw 3221	. . . . . . . . 9 ⊢ (∃𝑦 ∈ (𝐹‘0)(𝑦𝐵0) ∈ 𝐾 ↔ ∃𝑥 ∈ (𝐹‘0)(𝑥𝐵0) ∈ 𝐾)
23	19, 22	sylib 218	. . . . . . . 8 ⊢ (((𝐹‘0) ∈ Fin ∧ 𝑋 ⊆ ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0) ∧ 𝑋 ∈ 𝐾) → ∃𝑥 ∈ (𝐹‘0)(𝑥𝐵0) ∈ 𝐾)
24	23	3expia 1121	. . . . . . 7 ⊢ (((𝐹‘0) ∈ Fin ∧ 𝑋 ⊆ ∪ 𝑦 ∈ (𝐹‘0)(𝑦𝐵0)) → (𝑋 ∈ 𝐾 → ∃𝑥 ∈ (𝐹‘0)(𝑥𝐵0) ∈ 𝐾))
25	6, 15, 24	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝑋 ∈ 𝐾 → ∃𝑥 ∈ (𝐹‘0)(𝑥𝐵0) ∈ 𝐾))
26	25	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → (𝑋 ∈ 𝐾 → ∃𝑥 ∈ (𝐹‘0)(𝑥𝐵0) ∈ 𝐾))
27		heibor.4	. . . . . . . . . 10 ⊢ 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
28		vex 3463	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
29		c0ex 11229	. . . . . . . . . 10 ⊢ 0 ∈ V
30	16, 17, 27, 28, 29	heiborlem2 37836	. . . . . . . . 9 ⊢ (𝑥𝐺0 ↔ (0 ∈ ℕ0 ∧ 𝑥 ∈ (𝐹‘0) ∧ (𝑥𝐵0) ∈ 𝐾))
31		heibor.5	. . . . . . . . . . . 12 ⊢ 𝐵 = (𝑧 ∈ 𝑋, 𝑚 ∈ ℕ0 ↦ (𝑧(ball‘𝐷)(1 / (2↑𝑚))))
32		heibor.6	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 ∈ (CMet‘𝑋))
33	16, 17, 27, 31, 32, 1, 7	heiborlem3 37837	. . . . . . . . . . 11 ⊢ (𝜑 → ∃𝑔∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))
34	33	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑥𝐺0) → ∃𝑔∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))
35	32	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → 𝐷 ∈ (CMet‘𝑋))
36	1	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin))
37	7	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛))
38		simprr 772	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))
39		fveq2 6876	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑡 → (𝑔‘𝑥) = (𝑔‘𝑡))
40		fveq2 6876	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑡 → (2nd ‘𝑥) = (2nd ‘𝑡))
41	40	oveq1d 7420	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑡 → ((2nd ‘𝑥) + 1) = ((2nd ‘𝑡) + 1))
42	39, 41	breq12d 5132	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑡 → ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ↔ (𝑔‘𝑡)𝐺((2nd ‘𝑡) + 1)))
43		fveq2 6876	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑡 → (𝐵‘𝑥) = (𝐵‘𝑡))
44	39, 41	oveq12d 7423	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑡 → ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1)) = ((𝑔‘𝑡)𝐵((2nd ‘𝑡) + 1)))
45	43, 44	ineq12d 4196	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑡 → ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) = ((𝐵‘𝑡) ∩ ((𝑔‘𝑡)𝐵((2nd ‘𝑡) + 1))))
46	45	eleq1d 2819	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑡 → (((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾 ↔ ((𝐵‘𝑡) ∩ ((𝑔‘𝑡)𝐵((2nd ‘𝑡) + 1))) ∈ 𝐾))
47	42, 46	anbi12d 632	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑡 → (((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾) ↔ ((𝑔‘𝑡)𝐺((2nd ‘𝑡) + 1) ∧ ((𝐵‘𝑡) ∩ ((𝑔‘𝑡)𝐵((2nd ‘𝑡) + 1))) ∈ 𝐾)))
48	47	cbvralvw 3220	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾) ↔ ∀𝑡 ∈ 𝐺 ((𝑔‘𝑡)𝐺((2nd ‘𝑡) + 1) ∧ ((𝐵‘𝑡) ∩ ((𝑔‘𝑡)𝐵((2nd ‘𝑡) + 1))) ∈ 𝐾))
49	38, 48	sylib 218	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → ∀𝑡 ∈ 𝐺 ((𝑔‘𝑡)𝐺((2nd ‘𝑡) + 1) ∧ ((𝐵‘𝑡) ∩ ((𝑔‘𝑡)𝐵((2nd ‘𝑡) + 1))) ∈ 𝐾))
50		simprl 770	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → 𝑥𝐺0)
51		eqeq1 2739	. . . . . . . . . . . . . . . 16 ⊢ (𝑔 = 𝑚 → (𝑔 = 0 ↔ 𝑚 = 0))
52		oveq1 7412	. . . . . . . . . . . . . . . 16 ⊢ (𝑔 = 𝑚 → (𝑔 − 1) = (𝑚 − 1))
53	51, 52	ifbieq2d 4527	. . . . . . . . . . . . . . 15 ⊢ (𝑔 = 𝑚 → if(𝑔 = 0, 𝑥, (𝑔 − 1)) = if(𝑚 = 0, 𝑥, (𝑚 − 1)))
54	53	cbvmptv 5225	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ ℕ0 ↦ if(𝑔 = 0, 𝑥, (𝑔 − 1))) = (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝑥, (𝑚 − 1)))
55		seqeq3 14024	. . . . . . . . . . . . . 14 ⊢ ((𝑔 ∈ ℕ0 ↦ if(𝑔 = 0, 𝑥, (𝑔 − 1))) = (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝑥, (𝑚 − 1))) → seq0(𝑔, (𝑔 ∈ ℕ0 ↦ if(𝑔 = 0, 𝑥, (𝑔 − 1)))) = seq0(𝑔, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝑥, (𝑚 − 1)))))
56	54, 55	ax-mp 5	. . . . . . . . . . . . 13 ⊢ seq0(𝑔, (𝑔 ∈ ℕ0 ↦ if(𝑔 = 0, 𝑥, (𝑔 − 1)))) = seq0(𝑔, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝑥, (𝑚 − 1))))
57		eqid 2735	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ ↦ ⟨(seq0(𝑔, (𝑔 ∈ ℕ0 ↦ if(𝑔 = 0, 𝑥, (𝑔 − 1))))‘𝑛), (3 / (2↑𝑛))⟩) = (𝑛 ∈ ℕ ↦ ⟨(seq0(𝑔, (𝑔 ∈ ℕ0 ↦ if(𝑔 = 0, 𝑥, (𝑔 − 1))))‘𝑛), (3 / (2↑𝑛))⟩)
58		simplrl 776	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → 𝑈 ⊆ 𝐽)
59		cmetmet 25238	. . . . . . . . . . . . . . . . 17 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝐷 ∈ (Met‘𝑋))
60		metxmet 24273	. . . . . . . . . . . . . . . . 17 ⊢ (𝐷 ∈ (Met‘𝑋) → 𝐷 ∈ (∞Met‘𝑋))
61	16	mopnuni 24380	. . . . . . . . . . . . . . . . 17 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 = ∪ 𝐽)
62	32, 59, 60, 61	4syl 19	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑋 = ∪ 𝐽)
63	62	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → 𝑋 = ∪ 𝐽)
64		simprr 772	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → ∪ 𝐽 = ∪ 𝑈)
65	63, 64	eqtr2d 2771	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → ∪ 𝑈 = 𝑋)
66	65	adantr 480	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → ∪ 𝑈 = 𝑋)
67	16, 17, 27, 31, 35, 36, 37, 49, 50, 56, 57, 58, 66	heiborlem9 37843	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (𝑥𝐺0 ∧ ∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))) → ¬ 𝑋 ∈ 𝐾)
68	67	expr 456	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑥𝐺0) → (∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾) → ¬ 𝑋 ∈ 𝐾))
69	68	exlimdv 1933	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑥𝐺0) → (∃𝑔∀𝑥 ∈ 𝐺 ((𝑔‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑔‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾) → ¬ 𝑋 ∈ 𝐾))
70	34, 69	mpd 15	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑥𝐺0) → ¬ 𝑋 ∈ 𝐾)
71	30, 70	sylan2br 595	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ (0 ∈ ℕ0 ∧ 𝑥 ∈ (𝐹‘0) ∧ (𝑥𝐵0) ∈ 𝐾)) → ¬ 𝑋 ∈ 𝐾)
72	71	3exp2 1355	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → (0 ∈ ℕ0 → (𝑥 ∈ (𝐹‘0) → ((𝑥𝐵0) ∈ 𝐾 → ¬ 𝑋 ∈ 𝐾))))
73	2, 72	mpi 20	. . . . . 6 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → (𝑥 ∈ (𝐹‘0) → ((𝑥𝐵0) ∈ 𝐾 → ¬ 𝑋 ∈ 𝐾)))
74	73	rexlimdv 3139	. . . . 5 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → (∃𝑥 ∈ (𝐹‘0)(𝑥𝐵0) ∈ 𝐾 → ¬ 𝑋 ∈ 𝐾))
75	26, 74	syld 47	. . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → (𝑋 ∈ 𝐾 → ¬ 𝑋 ∈ 𝐾))
76	75	pm2.01d 190	. . 3 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → ¬ 𝑋 ∈ 𝐾)
77		elfvdm 6913	. . . . . 6 ⊢ (𝐷 ∈ (CMet‘𝑋) → 𝑋 ∈ dom CMet)
78		sseq1 3984	. . . . . . . . 9 ⊢ (𝑢 = 𝑋 → (𝑢 ⊆ ∪ 𝑣 ↔ 𝑋 ⊆ ∪ 𝑣))
79	78	rexbidv 3164	. . . . . . . 8 ⊢ (𝑢 = 𝑋 → (∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣 ↔ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑋 ⊆ ∪ 𝑣))
80	79	notbid 318	. . . . . . 7 ⊢ (𝑢 = 𝑋 → (¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑋 ⊆ ∪ 𝑣))
81	80, 17	elab2g 3659	. . . . . 6 ⊢ (𝑋 ∈ dom CMet → (𝑋 ∈ 𝐾 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑋 ⊆ ∪ 𝑣))
82	32, 77, 81	3syl 18	. . . . 5 ⊢ (𝜑 → (𝑋 ∈ 𝐾 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑋 ⊆ ∪ 𝑣))
83	82	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → (𝑋 ∈ 𝐾 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑋 ⊆ ∪ 𝑣))
84	83	con2bid 354	. . 3 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → (∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑋 ⊆ ∪ 𝑣 ↔ ¬ 𝑋 ∈ 𝐾))
85	76, 84	mpbird 257	. 2 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑋 ⊆ ∪ 𝑣)
86	62	ad2antrr 726	. . . . 5 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑣 ∈ (𝒫 𝑈 ∩ Fin)) → 𝑋 = ∪ 𝐽)
87	86	sseq1d 3990	. . . 4 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑣 ∈ (𝒫 𝑈 ∩ Fin)) → (𝑋 ⊆ ∪ 𝑣 ↔ ∪ 𝐽 ⊆ ∪ 𝑣))
88		inss1 4212	. . . . . . . . 9 ⊢ (𝒫 𝑈 ∩ Fin) ⊆ 𝒫 𝑈
89	88	sseli 3954	. . . . . . . 8 ⊢ (𝑣 ∈ (𝒫 𝑈 ∩ Fin) → 𝑣 ∈ 𝒫 𝑈)
90	89	elpwid 4584	. . . . . . 7 ⊢ (𝑣 ∈ (𝒫 𝑈 ∩ Fin) → 𝑣 ⊆ 𝑈)
91		simprl 770	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → 𝑈 ⊆ 𝐽)
92		sstr 3967	. . . . . . . 8 ⊢ ((𝑣 ⊆ 𝑈 ∧ 𝑈 ⊆ 𝐽) → 𝑣 ⊆ 𝐽)
93	92	unissd 4893	. . . . . . 7 ⊢ ((𝑣 ⊆ 𝑈 ∧ 𝑈 ⊆ 𝐽) → ∪ 𝑣 ⊆ ∪ 𝐽)
94	90, 91, 93	syl2anr 597	. . . . . 6 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑣 ∈ (𝒫 𝑈 ∩ Fin)) → ∪ 𝑣 ⊆ ∪ 𝐽)
95	94	biantrud 531	. . . . 5 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑣 ∈ (𝒫 𝑈 ∩ Fin)) → (∪ 𝐽 ⊆ ∪ 𝑣 ↔ (∪ 𝐽 ⊆ ∪ 𝑣 ∧ ∪ 𝑣 ⊆ ∪ 𝐽)))
96		eqss 3974	. . . . 5 ⊢ (∪ 𝐽 = ∪ 𝑣 ↔ (∪ 𝐽 ⊆ ∪ 𝑣 ∧ ∪ 𝑣 ⊆ ∪ 𝐽))
97	95, 96	bitr4di 289	. . . 4 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑣 ∈ (𝒫 𝑈 ∩ Fin)) → (∪ 𝐽 ⊆ ∪ 𝑣 ↔ ∪ 𝐽 = ∪ 𝑣))
98	87, 97	bitrd 279	. . 3 ⊢ (((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) ∧ 𝑣 ∈ (𝒫 𝑈 ∩ Fin)) → (𝑋 ⊆ ∪ 𝑣 ↔ ∪ 𝐽 = ∪ 𝑣))
99	98	rexbidva 3162	. 2 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → (∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑋 ⊆ ∪ 𝑣 ↔ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)∪ 𝐽 = ∪ 𝑣))
100	85, 99	mpbid 232	1 ⊢ ((𝜑 ∧ (𝑈 ⊆ 𝐽 ∧ ∪ 𝐽 = ∪ 𝑈)) → ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)∪ 𝐽 = ∪ 𝑣)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2108  {cab 2713  ∀wral 3051  ∃wrex 3060   ∩ cin 3925   ⊆ wss 3926  ifcif 4500  𝒫 cpw 4575  ⟨cop 4607  ∪ cuni 4883  ∪ ciun 4967   class class class wbr 5119  {copab 5181   ↦ cmpt 5201  dom cdm 5654  ⟶wf 6527  ‘cfv 6531  (class class class)co 7405   ∈ cmpo 7407  2^nd c2nd 7987  Fincfn 8959  0cc0 11129  1c1 11130   + caddc 11132   − cmin 11466   / cdiv 11894  ℕcn 12240  2c2 12295  3c3 12296  ℕ₀cn0 12501  seqcseq 14019  ↑cexp 14079  ∞Metcxmet 21300  Metcmet 21301  ballcbl 21302  MetOpencmopn 21305  CMetccmet 25206

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-inf2 9655  ax-cc 10449  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206  ax-pre-sup 11207

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-iin 4970  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-se 5607  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7862  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-er 8719  df-map 8842  df-pm 8843  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-sup 9454  df-inf 9455  df-oi 9524  df-card 9953  df-acn 9956  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-div 11895  df-nn 12241  df-2 12303  df-3 12304  df-n0 12502  df-z 12589  df-uz 12853  df-q 12965  df-rp 13009  df-xneg 13128  df-xadd 13129  df-xmul 13130  df-ico 13368  df-icc 13369  df-fl 13809  df-seq 14020  df-exp 14080  df-rest 17436  df-topgen 17457  df-psmet 21307  df-xmet 21308  df-met 21309  df-bl 21310  df-mopn 21311  df-fbas 21312  df-fg 21313  df-top 22832  df-topon 22849  df-bases 22884  df-cld 22957  df-ntr 22958  df-cls 22959  df-nei 23036  df-lm 23167  df-haus 23253  df-fil 23784  df-fm 23876  df-flim 23877  df-flf 23878  df-cfil 25207  df-cau 25208  df-cmet 25209

This theorem is referenced by:  heibor  37845