Theorem heiborlem1 35896

Description: Lemma for heibor 35906. We work with a fixed open cover 𝑈 throughout. The set 𝐾 is the set of all subsets of 𝑋 that admit no finite subcover of 𝑈. (We wish to prove that 𝐾 is empty.) If a set 𝐶 has no finite subcover, then any finite cover of 𝐶 must contain a set that also has no finite subcover. (Contributed by Jeff Madsen, 23-Jan-2014.)

Hypotheses

Ref	Expression
heibor.1	⊢ 𝐽 = (MetOpen‘𝐷)
heibor.3	⊢ 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣}
heiborlem1.4	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
heiborlem1	⊢ ((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝐶 ∈ 𝐾) → ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝐾)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑢,𝑣,𝐷   𝑢,𝐵,𝑣   𝑢,𝐽,𝑣,𝑥   𝑢,𝑈,𝑣,𝑥   𝑢,𝐶,𝑣   𝑥,𝐾

Allowed substitution hints:   𝐴(𝑣,𝑢)   𝐵(𝑥)   𝐶(𝑥)   𝐾(𝑣,𝑢)

Proof of Theorem heiborlem1

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		heiborlem1.4	. . . . . . . 8 ⊢ 𝐵 ∈ V
2		sseq1 3942	. . . . . . . . . 10 ⊢ (𝑢 = 𝐵 → (𝑢 ⊆ ∪ 𝑣 ↔ 𝐵 ⊆ ∪ 𝑣))
3	2	rexbidv 3225	. . . . . . . . 9 ⊢ (𝑢 = 𝐵 → (∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣 ↔ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣))
4	3	notbid 317	. . . . . . . 8 ⊢ (𝑢 = 𝐵 → (¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣))
5		heibor.3	. . . . . . . 8 ⊢ 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣}
6	1, 4, 5	elab2 3606	. . . . . . 7 ⊢ (𝐵 ∈ 𝐾 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣)
7	6	con2bii 357	. . . . . 6 ⊢ (∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣 ↔ ¬ 𝐵 ∈ 𝐾)
8	7	ralbii 3090	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝐵 ∈ 𝐾)
9		ralnex 3163	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝐵 ∈ 𝐾 ↔ ¬ ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝐾)
10	8, 9	bitr2i 275	. . . 4 ⊢ (¬ ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝐾 ↔ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣)
11		unieq 4847	. . . . . . . . 9 ⊢ (𝑣 = (𝑡‘𝑥) → ∪ 𝑣 = ∪ (𝑡‘𝑥))
12	11	sseq2d 3949	. . . . . . . 8 ⊢ (𝑣 = (𝑡‘𝑥) → (𝐵 ⊆ ∪ 𝑣 ↔ 𝐵 ⊆ ∪ (𝑡‘𝑥)))
13	12	ac6sfi 8988	. . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣) → ∃𝑡(𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥)))
14	13	ex 412	. . . . . 6 ⊢ (𝐴 ∈ Fin → (∀𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣 → ∃𝑡(𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))))
15	14	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (∀𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣 → ∃𝑡(𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))))
16		sseq1 3942	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝐶 → (𝑢 ⊆ ∪ 𝑣 ↔ 𝐶 ⊆ ∪ 𝑣))
17	16	rexbidv 3225	. . . . . . . . . . 11 ⊢ (𝑢 = 𝐶 → (∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣 ↔ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐶 ⊆ ∪ 𝑣))
18	17	notbid 317	. . . . . . . . . 10 ⊢ (𝑢 = 𝐶 → (¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐶 ⊆ ∪ 𝑣))
19	18, 5	elab2g 3604	. . . . . . . . 9 ⊢ (𝐶 ∈ 𝐾 → (𝐶 ∈ 𝐾 ↔ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐶 ⊆ ∪ 𝑣))
20	19	ibi 266	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐾 → ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐶 ⊆ ∪ 𝑣)
21		frn 6591	. . . . . . . . . . . . . . 15 ⊢ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) → ran 𝑡 ⊆ (𝒫 𝑈 ∩ Fin))
22	21	ad2antrl 724	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ran 𝑡 ⊆ (𝒫 𝑈 ∩ Fin))
23		inss1 4159	. . . . . . . . . . . . . 14 ⊢ (𝒫 𝑈 ∩ Fin) ⊆ 𝒫 𝑈
24	22, 23	sstrdi 3929	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ran 𝑡 ⊆ 𝒫 𝑈)
25		sspwuni 5025	. . . . . . . . . . . . 13 ⊢ (ran 𝑡 ⊆ 𝒫 𝑈 ↔ ∪ ran 𝑡 ⊆ 𝑈)
26	24, 25	sylib 217	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∪ ran 𝑡 ⊆ 𝑈)
27		vex 3426	. . . . . . . . . . . . . . 15 ⊢ 𝑡 ∈ V
28	27	rnex 7733	. . . . . . . . . . . . . 14 ⊢ ran 𝑡 ∈ V
29	28	uniex 7572	. . . . . . . . . . . . 13 ⊢ ∪ ran 𝑡 ∈ V
30	29	elpw 4534	. . . . . . . . . . . 12 ⊢ (∪ ran 𝑡 ∈ 𝒫 𝑈 ↔ ∪ ran 𝑡 ⊆ 𝑈)
31	26, 30	sylibr 233	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∪ ran 𝑡 ∈ 𝒫 𝑈)
32		ffn 6584	. . . . . . . . . . . . . . 15 ⊢ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) → 𝑡 Fn 𝐴)
33	32	ad2antrl 724	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → 𝑡 Fn 𝐴)
34		dffn4 6678	. . . . . . . . . . . . . 14 ⊢ (𝑡 Fn 𝐴 ↔ 𝑡:𝐴–onto→ran 𝑡)
35	33, 34	sylib 217	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → 𝑡:𝐴–onto→ran 𝑡)
36		fofi 9035	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Fin ∧ 𝑡:𝐴–onto→ran 𝑡) → ran 𝑡 ∈ Fin)
37	35, 36	syldan 590	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ran 𝑡 ∈ Fin)
38		inss2 4160	. . . . . . . . . . . . 13 ⊢ (𝒫 𝑈 ∩ Fin) ⊆ Fin
39	22, 38	sstrdi 3929	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ran 𝑡 ⊆ Fin)
40		unifi 9038	. . . . . . . . . . . 12 ⊢ ((ran 𝑡 ∈ Fin ∧ ran 𝑡 ⊆ Fin) → ∪ ran 𝑡 ∈ Fin)
41	37, 39, 40	syl2anc 583	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∪ ran 𝑡 ∈ Fin)
42	31, 41	elind 4124	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∪ ran 𝑡 ∈ (𝒫 𝑈 ∩ Fin))
43	42	adantlr 711	. . . . . . . . 9 ⊢ (((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∪ ran 𝑡 ∈ (𝒫 𝑈 ∩ Fin))
44		simplr 765	. . . . . . . . . 10 ⊢ (((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
45		fnfvelrn 6940	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑡 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑡‘𝑥) ∈ ran 𝑡)
46	32, 45	sylan 579	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ 𝑥 ∈ 𝐴) → (𝑡‘𝑥) ∈ ran 𝑡)
47	46	adantll 710	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ Fin ∧ 𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin)) ∧ 𝑥 ∈ 𝐴) → (𝑡‘𝑥) ∈ ran 𝑡)
48		elssuni 4868	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡‘𝑥) ∈ ran 𝑡 → (𝑡‘𝑥) ⊆ ∪ ran 𝑡)
49		uniss 4844	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡‘𝑥) ⊆ ∪ ran 𝑡 → ∪ (𝑡‘𝑥) ⊆ ∪ ∪ ran 𝑡)
50	47, 48, 49	3syl 18	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ Fin ∧ 𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin)) ∧ 𝑥 ∈ 𝐴) → ∪ (𝑡‘𝑥) ⊆ ∪ ∪ ran 𝑡)
51		sstr2 3924	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ⊆ ∪ (𝑡‘𝑥) → (∪ (𝑡‘𝑥) ⊆ ∪ ∪ ran 𝑡 → 𝐵 ⊆ ∪ ∪ ran 𝑡))
52	50, 51	syl5com 31	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ Fin ∧ 𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin)) ∧ 𝑥 ∈ 𝐴) → (𝐵 ⊆ ∪ (𝑡‘𝑥) → 𝐵 ⊆ ∪ ∪ ran 𝑡))
53	52	ralimdva 3102	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Fin ∧ 𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin)) → (∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥) → ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ ∪ ran 𝑡))
54	53	impr 454	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ ∪ ran 𝑡)
55		iunss 4971	. . . . . . . . . . . 12 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∪ ∪ ran 𝑡 ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ ∪ ran 𝑡)
56	54, 55	sylibr 233	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∪ ∪ ran 𝑡)
57	56	adantlr 711	. . . . . . . . . 10 ⊢ (((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∪ ∪ ran 𝑡)
58	44, 57	sstrd 3927	. . . . . . . . 9 ⊢ (((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → 𝐶 ⊆ ∪ ∪ ran 𝑡)
59		unieq 4847	. . . . . . . . . . 11 ⊢ (𝑣 = ∪ ran 𝑡 → ∪ 𝑣 = ∪ ∪ ran 𝑡)
60	59	sseq2d 3949	. . . . . . . . . 10 ⊢ (𝑣 = ∪ ran 𝑡 → (𝐶 ⊆ ∪ 𝑣 ↔ 𝐶 ⊆ ∪ ∪ ran 𝑡))
61	60	rspcev 3552	. . . . . . . . 9 ⊢ ((∪ ran 𝑡 ∈ (𝒫 𝑈 ∩ Fin) ∧ 𝐶 ⊆ ∪ ∪ ran 𝑡) → ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐶 ⊆ ∪ 𝑣)
62	43, 58, 61	syl2anc 583	. . . . . . . 8 ⊢ (((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐶 ⊆ ∪ 𝑣)
63	20, 62	nsyl3 138	. . . . . . 7 ⊢ (((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) ∧ (𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥))) → ¬ 𝐶 ∈ 𝐾)
64	63	ex 412	. . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → ((𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥)) → ¬ 𝐶 ∈ 𝐾))
65	64	exlimdv 1937	. . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (∃𝑡(𝑡:𝐴⟶(𝒫 𝑈 ∩ Fin) ∧ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ∪ (𝑡‘𝑥)) → ¬ 𝐶 ∈ 𝐾))
66	15, 65	syld 47	. . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (∀𝑥 ∈ 𝐴 ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝐵 ⊆ ∪ 𝑣 → ¬ 𝐶 ∈ 𝐾))
67	10, 66	syl5bi 241	. . 3 ⊢ ((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (¬ ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝐾 → ¬ 𝐶 ∈ 𝐾))
68	67	con4d 115	. 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) → (𝐶 ∈ 𝐾 → ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝐾))
69	68	3impia 1115	1 ⊢ ((𝐴 ∈ Fin ∧ 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵 ∧ 𝐶 ∈ 𝐾) → ∃𝑥 ∈ 𝐴 𝐵 ∈ 𝐾)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539  ∃wex 1783   ∈ wcel 2108  {cab 2715  ∀wral 3063  ∃wrex 3064  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883  𝒫 cpw 4530  ∪ cuni 4836  ∪ ciun 4921  ran crn 5581   Fn wfn 6413  ⟶wf 6414  –onto→wfo 6416  ‘cfv 6418  Fincfn 8691  MetOpencmopn 20500

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-om 7688  df-1o 8267  df-er 8456  df-en 8692  df-dom 8693  df-fin 8695

This theorem is referenced by:  heiborlem3  35898  heiborlem10  35905