Theorem ustincl 24435

Description: A uniform structure is closed under finite intersection. Condition F_II of [BourbakiTop1] p. I.36. (Contributed by Thierry Arnoux, 30-Nov-2017.)

Assertion

Ref	Expression
ustincl	⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑊 ∈ 𝑈) → (𝑉 ∩ 𝑊) ∈ 𝑈)

Proof of Theorem ustincl

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

Step	Hyp	Ref	Expression
1		elfvex 6914	. . . . . . . 8 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
2		isust 24431	. . . . . . . 8 ⊢ (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))))
3	1, 2	syl 18	. . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))))
4	3	ibi 270	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣))))
5	4	simp3d 1162	. . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))
6		sseq1 3956	. . . . . . . . 9 ⊢ (𝑣 = 𝑉 → (𝑣 ⊆ 𝑤 ↔ 𝑉 ⊆ 𝑤))
7	6	imbi1d 344	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → ((𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ↔ (𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈)))
8	7	ralbidv 3185	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ↔ ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈)))
9		ineq1 4159	. . . . . . . . 9 ⊢ (𝑣 = 𝑉 → (𝑣 ∩ 𝑤) = (𝑉 ∩ 𝑤))
10	9	eleq1d 2845	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → ((𝑣 ∩ 𝑤) ∈ 𝑈 ↔ (𝑉 ∩ 𝑤) ∈ 𝑈))
11	10	ralbidv 3185	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ↔ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈))
12		sseq2 3957	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (( I ↾ 𝑋) ⊆ 𝑣 ↔ ( I ↾ 𝑋) ⊆ 𝑉))
13		cnveq 5853	. . . . . . . . 9 ⊢ (𝑣 = 𝑉 → ◡𝑣 = ◡𝑉)
14	13	eleq1d 2845	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (◡𝑣 ∈ 𝑈 ↔ ◡𝑉 ∈ 𝑈))
15		sseq2 3957	. . . . . . . . 9 ⊢ (𝑣 = 𝑉 → ((𝑤 ∘ 𝑤) ⊆ 𝑣 ↔ (𝑤 ∘ 𝑤) ⊆ 𝑉))
16	15	rexbidv 3186	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣 ↔ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))
17	12, 14, 16	3anbi123d 1464	. . . . . . 7 ⊢ (𝑣 = 𝑉 → ((( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣) ↔ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉)))
18	8, 11, 17	3anbi123d 1464	. . . . . 6 ⊢ (𝑣 = 𝑉 → ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)) ↔ (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))))
19	18	rspcv 3572	. . . . 5 ⊢ (𝑉 ∈ 𝑈 → (∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))))
20	5, 19	mpan9 516	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉)))
21	20	simp2d 1161	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈)
22		ineq2 4160	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑉 ∩ 𝑤) = (𝑉 ∩ 𝑊))
23	22	eleq1d 2845	. . . 4 ⊢ (𝑤 = 𝑊 → ((𝑉 ∩ 𝑤) ∈ 𝑈 ↔ (𝑉 ∩ 𝑊) ∈ 𝑈))
24	23	rspcv 3572	. . 3 ⊢ (𝑊 ∈ 𝑈 → (∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 → (𝑉 ∩ 𝑊) ∈ 𝑈))
25	21, 24	mpan9 516	. 2 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑊 ∈ 𝑈) → (𝑉 ∩ 𝑊) ∈ 𝑈)
26	25	3impa 1127	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑊 ∈ 𝑈) → (𝑉 ∩ 𝑊) ∈ 𝑈)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557   I cid 5549   × cxp 5653  ^◡ccnv 5654   ↾ cres 5657   ∘ ccom 5659  ‘cfv 6533  UnifOncust 24427

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 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-res 5667  df-iota 6489  df-fun 6535  df-fv 6541  df-ust 24428

This theorem is used by:  ustexsym  24443  trust  24456  utoptop  24461  restutopopn  24465  ustuqtop2  24469