Theorem ustincl 23267

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 6789	. . . . . . . 8 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
2		isust 23263	. . . . . . . 8 ⊢ (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))))
3	1, 2	syl 17	. . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))))
4	3	ibi 266	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣))))
5	4	simp3d 1142	. . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))
6		sseq1 3942	. . . . . . . . 9 ⊢ (𝑣 = 𝑉 → (𝑣 ⊆ 𝑤 ↔ 𝑉 ⊆ 𝑤))
7	6	imbi1d 341	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → ((𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ↔ (𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈)))
8	7	ralbidv 3120	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ↔ ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈)))
9		ineq1 4136	. . . . . . . . 9 ⊢ (𝑣 = 𝑉 → (𝑣 ∩ 𝑤) = (𝑉 ∩ 𝑤))
10	9	eleq1d 2823	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → ((𝑣 ∩ 𝑤) ∈ 𝑈 ↔ (𝑉 ∩ 𝑤) ∈ 𝑈))
11	10	ralbidv 3120	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ↔ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈))
12		sseq2 3943	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (( I ↾ 𝑋) ⊆ 𝑣 ↔ ( I ↾ 𝑋) ⊆ 𝑉))
13		cnveq 5771	. . . . . . . . 9 ⊢ (𝑣 = 𝑉 → ◡𝑣 = ◡𝑉)
14	13	eleq1d 2823	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (◡𝑣 ∈ 𝑈 ↔ ◡𝑉 ∈ 𝑈))
15		sseq2 3943	. . . . . . . . 9 ⊢ (𝑣 = 𝑉 → ((𝑤 ∘ 𝑤) ⊆ 𝑣 ↔ (𝑤 ∘ 𝑤) ⊆ 𝑉))
16	15	rexbidv 3225	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣 ↔ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))
17	12, 14, 16	3anbi123d 1434	. . . . . . 7 ⊢ (𝑣 = 𝑉 → ((( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣) ↔ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉)))
18	8, 11, 17	3anbi123d 1434	. . . . . 6 ⊢ (𝑣 = 𝑉 → ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)) ↔ (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))))
19	18	rspcv 3547	. . . . 5 ⊢ (𝑉 ∈ 𝑈 → (∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))))
20	5, 19	mpan9 506	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉)))
21	20	simp2d 1141	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈)
22		ineq2 4137	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑉 ∩ 𝑤) = (𝑉 ∩ 𝑊))
23	22	eleq1d 2823	. . . 4 ⊢ (𝑤 = 𝑊 → ((𝑉 ∩ 𝑤) ∈ 𝑈 ↔ (𝑉 ∩ 𝑊) ∈ 𝑈))
24	23	rspcv 3547	. . 3 ⊢ (𝑊 ∈ 𝑈 → (∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 → (𝑉 ∩ 𝑊) ∈ 𝑈))
25	21, 24	mpan9 506	. 2 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑊 ∈ 𝑈) → (𝑉 ∩ 𝑊) ∈ 𝑈)
26	25	3impa 1108	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑊 ∈ 𝑈) → (𝑉 ∩ 𝑊) ∈ 𝑈)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  Vcvv 3422   ∩ cin 3882   ⊆ wss 3883  𝒫 cpw 4530   I cid 5479   × cxp 5578  ^◡ccnv 5579   ↾ cres 5582   ∘ ccom 5584  ‘cfv 6418  UnifOncust 23259

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-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-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-res 5592  df-iota 6376  df-fun 6420  df-fv 6426  df-ust 23260

This theorem is referenced by:  ustexsym  23275  trust  23289  utoptop  23294  restutopopn  23298  ustuqtop2  23302