Theorem trcfilu 22903

Description: Condition for the trace of a Cauchy filter base to be a Cauchy filter base for the restricted uniform structure. (Contributed by Thierry Arnoux, 24-Jan-2018.)

Assertion

Ref	Expression
trcfilu	⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → (𝐹 ↾t 𝐴) ∈ (CauFilu‘(𝑈 ↾t (𝐴 × 𝐴))))

Proof of Theorem trcfilu

Dummy variables 𝑎 𝑏 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1132	. . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → 𝑈 ∈ (UnifOn‘𝑋))
2		simp2l 1195	. . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → 𝐹 ∈ (CauFilu‘𝑈))
3		iscfilu 22897	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐹 ∈ (CauFilu‘𝑈) ↔ (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑣 ∈ 𝑈 ∃𝑎 ∈ 𝐹 (𝑎 × 𝑎) ⊆ 𝑣)))
4	3	biimpa 479	. . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐹 ∈ (CauFilu‘𝑈)) → (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑣 ∈ 𝑈 ∃𝑎 ∈ 𝐹 (𝑎 × 𝑎) ⊆ 𝑣))
5	1, 2, 4	syl2anc 586	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑣 ∈ 𝑈 ∃𝑎 ∈ 𝐹 (𝑎 × 𝑎) ⊆ 𝑣))
6	5	simpld 497	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → 𝐹 ∈ (fBas‘𝑋))
7		simp3 1134	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋)
8		simp2r 1196	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → ¬ ∅ ∈ (𝐹 ↾t 𝐴))
9		trfbas2 22451	. . . 4 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴 ⊆ 𝑋) → ((𝐹 ↾t 𝐴) ∈ (fBas‘𝐴) ↔ ¬ ∅ ∈ (𝐹 ↾t 𝐴)))
10	9	biimpar 480	. . 3 ⊢ (((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) → (𝐹 ↾t 𝐴) ∈ (fBas‘𝐴))
11	6, 7, 8, 10	syl21anc 835	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → (𝐹 ↾t 𝐴) ∈ (fBas‘𝐴))
12	2	ad5antr 732	. . . . . . 7 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → 𝐹 ∈ (CauFilu‘𝑈))
13	1	adantr 483	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → 𝑈 ∈ (UnifOn‘𝑋))
14	13	elfvexd 6704	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → 𝑋 ∈ V)
15	7	adantr 483	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → 𝐴 ⊆ 𝑋)
16	14, 15	ssexd 5228	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → 𝐴 ∈ V)
17	16	ad4antr 730	. . . . . . 7 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → 𝐴 ∈ V)
18		simplr 767	. . . . . . 7 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → 𝑎 ∈ 𝐹)
19		elrestr 16702	. . . . . . 7 ⊢ ((𝐹 ∈ (CauFilu‘𝑈) ∧ 𝐴 ∈ V ∧ 𝑎 ∈ 𝐹) → (𝑎 ∩ 𝐴) ∈ (𝐹 ↾t 𝐴))
20	12, 17, 18, 19	syl3anc 1367	. . . . . 6 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → (𝑎 ∩ 𝐴) ∈ (𝐹 ↾t 𝐴))
21		inxp 5703	. . . . . . 7 ⊢ ((𝑎 × 𝑎) ∩ (𝐴 × 𝐴)) = ((𝑎 ∩ 𝐴) × (𝑎 ∩ 𝐴))
22		simpr 487	. . . . . . . . 9 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → (𝑎 × 𝑎) ⊆ 𝑣)
23	22	ssrind 4212	. . . . . . . 8 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → ((𝑎 × 𝑎) ∩ (𝐴 × 𝐴)) ⊆ (𝑣 ∩ (𝐴 × 𝐴)))
24		simpllr 774	. . . . . . . 8 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → 𝑤 = (𝑣 ∩ (𝐴 × 𝐴)))
25	23, 24	sseqtrrd 4008	. . . . . . 7 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → ((𝑎 × 𝑎) ∩ (𝐴 × 𝐴)) ⊆ 𝑤)
26	21, 25	eqsstrrid 4016	. . . . . 6 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → ((𝑎 ∩ 𝐴) × (𝑎 ∩ 𝐴)) ⊆ 𝑤)
27		id 22	. . . . . . . . 9 ⊢ (𝑏 = (𝑎 ∩ 𝐴) → 𝑏 = (𝑎 ∩ 𝐴))
28	27	sqxpeqd 5587	. . . . . . . 8 ⊢ (𝑏 = (𝑎 ∩ 𝐴) → (𝑏 × 𝑏) = ((𝑎 ∩ 𝐴) × (𝑎 ∩ 𝐴)))
29	28	sseq1d 3998	. . . . . . 7 ⊢ (𝑏 = (𝑎 ∩ 𝐴) → ((𝑏 × 𝑏) ⊆ 𝑤 ↔ ((𝑎 ∩ 𝐴) × (𝑎 ∩ 𝐴)) ⊆ 𝑤))
30	29	rspcev 3623	. . . . . 6 ⊢ (((𝑎 ∩ 𝐴) ∈ (𝐹 ↾t 𝐴) ∧ ((𝑎 ∩ 𝐴) × (𝑎 ∩ 𝐴)) ⊆ 𝑤) → ∃𝑏 ∈ (𝐹 ↾t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
31	20, 26, 30	syl2anc 586	. . . . 5 ⊢ (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎 ∈ 𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → ∃𝑏 ∈ (𝐹 ↾t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
32	5	simprd 498	. . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → ∀𝑣 ∈ 𝑈 ∃𝑎 ∈ 𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
33	32	r19.21bi 3208	. . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑣 ∈ 𝑈) → ∃𝑎 ∈ 𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
34	33	ad4ant13 749	. . . . 5 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) → ∃𝑎 ∈ 𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
35	31, 34	r19.29a 3289	. . . 4 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ 𝑣 ∈ 𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) → ∃𝑏 ∈ (𝐹 ↾t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
36	16, 16	xpexd 7474	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → (𝐴 × 𝐴) ∈ V)
37		simpr 487	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴)))
38		elrest 16701	. . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐴 × 𝐴) ∈ V) → (𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴)) ↔ ∃𝑣 ∈ 𝑈 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))))
39	38	biimpa 479	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐴 × 𝐴) ∈ V) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → ∃𝑣 ∈ 𝑈 𝑤 = (𝑣 ∩ (𝐴 × 𝐴)))
40	13, 36, 37, 39	syl21anc 835	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → ∃𝑣 ∈ 𝑈 𝑤 = (𝑣 ∩ (𝐴 × 𝐴)))
41	35, 40	r19.29a 3289	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → ∃𝑏 ∈ (𝐹 ↾t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
42	41	ralrimiva 3182	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → ∀𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))∃𝑏 ∈ (𝐹 ↾t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
43		trust 22838	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑈 ↾t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴))
44	1, 7, 43	syl2anc 586	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → (𝑈 ↾t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴))
45		iscfilu 22897	. . 3 ⊢ ((𝑈 ↾t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴) → ((𝐹 ↾t 𝐴) ∈ (CauFilu‘(𝑈 ↾t (𝐴 × 𝐴))) ↔ ((𝐹 ↾t 𝐴) ∈ (fBas‘𝐴) ∧ ∀𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))∃𝑏 ∈ (𝐹 ↾t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)))
46	44, 45	syl 17	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → ((𝐹 ↾t 𝐴) ∈ (CauFilu‘(𝑈 ↾t (𝐴 × 𝐴))) ↔ ((𝐹 ↾t 𝐴) ∈ (fBas‘𝐴) ∧ ∀𝑤 ∈ (𝑈 ↾t (𝐴 × 𝐴))∃𝑏 ∈ (𝐹 ↾t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)))
47	11, 42, 46	mpbir2and 711	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu‘𝑈) ∧ ¬ ∅ ∈ (𝐹 ↾t 𝐴)) ∧ 𝐴 ⊆ 𝑋) → (𝐹 ↾t 𝐴) ∈ (CauFilu‘(𝑈 ↾t (𝐴 × 𝐴))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ∀wral 3138  ∃wrex 3139  Vcvv 3494   ∩ cin 3935   ⊆ wss 3936  ∅c0 4291   × cxp 5553  ‘cfv 6355  (class class class)co 7156   ↾_t crest 16694  fBascfbas 20533  UnifOncust 22808  CauFil_uccfilu 22895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-1st 7689  df-2nd 7690  df-rest 16696  df-fbas 20542  df-ust 22809  df-cfilu 22896

This theorem is referenced by:  ucnextcn  22913