MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ustdiag Structured version   Visualization version   GIF version

Theorem ustdiag 21760
Description: The diagonal set is included in any entourage, i.e. any point is 𝑉 -close to itself. Condition UI of [BourbakiTop1] p. II.1. (Contributed by Thierry Arnoux, 2-Dec-2017.)
Assertion
Ref Expression
ustdiag ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → ( I ↾ 𝑋) ⊆ 𝑉)

Proof of Theorem ustdiag
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvex 6112 . . . . . . 7 (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
2 isust 21755 . . . . . . 7 (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
31, 2syl 17 . . . . . 6 (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
43ibi 254 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))))
54simp3d 1067 . . . 4 (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))
6 sseq1 3584 . . . . . . . 8 (𝑣 = 𝑉 → (𝑣𝑤𝑉𝑤))
76imbi1d 329 . . . . . . 7 (𝑣 = 𝑉 → ((𝑣𝑤𝑤𝑈) ↔ (𝑉𝑤𝑤𝑈)))
87ralbidv 2964 . . . . . 6 (𝑣 = 𝑉 → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ↔ ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈)))
9 ineq1 3764 . . . . . . . 8 (𝑣 = 𝑉 → (𝑣𝑤) = (𝑉𝑤))
109eleq1d 2667 . . . . . . 7 (𝑣 = 𝑉 → ((𝑣𝑤) ∈ 𝑈 ↔ (𝑉𝑤) ∈ 𝑈))
1110ralbidv 2964 . . . . . 6 (𝑣 = 𝑉 → (∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ↔ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈))
12 sseq2 3585 . . . . . . 7 (𝑣 = 𝑉 → (( I ↾ 𝑋) ⊆ 𝑣 ↔ ( I ↾ 𝑋) ⊆ 𝑉))
13 cnveq 5202 . . . . . . . 8 (𝑣 = 𝑉𝑣 = 𝑉)
1413eleq1d 2667 . . . . . . 7 (𝑣 = 𝑉 → (𝑣𝑈𝑉𝑈))
15 sseq2 3585 . . . . . . . 8 (𝑣 = 𝑉 → ((𝑤𝑤) ⊆ 𝑣 ↔ (𝑤𝑤) ⊆ 𝑉))
1615rexbidv 3029 . . . . . . 7 (𝑣 = 𝑉 → (∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣 ↔ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))
1712, 14, 163anbi123d 1390 . . . . . 6 (𝑣 = 𝑉 → ((( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣) ↔ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉)))
188, 11, 173anbi123d 1390 . . . . 5 (𝑣 = 𝑉 → ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) ↔ (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))))
1918rspcv 3273 . . . 4 (𝑉𝑈 → (∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))))
205, 19mpan9 484 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉)))
2120simp3d 1067 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))
2221simp1d 1065 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → ( I ↾ 𝑋) ⊆ 𝑉)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  wa 382  w3a 1030   = wceq 1474  wcel 1975  wral 2891  wrex 2892  Vcvv 3168  cin 3534  wss 3535  𝒫 cpw 4103   I cid 4934   × cxp 5022  ccnv 5023  cres 5026  ccom 5028  cfv 5786  UnifOncust 21751
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-8 1977  ax-9 1984  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2228  ax-ext 2585  ax-sep 4699  ax-nul 4708  ax-pow 4760  ax-pr 4824  ax-un 6820
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-eu 2457  df-mo 2458  df-clab 2592  df-cleq 2598  df-clel 2601  df-nfc 2735  df-ne 2777  df-ral 2896  df-rex 2897  df-rab 2900  df-v 3170  df-sbc 3398  df-csb 3495  df-dif 3538  df-un 3540  df-in 3542  df-ss 3549  df-nul 3870  df-if 4032  df-pw 4105  df-sn 4121  df-pr 4123  df-op 4127  df-uni 4363  df-br 4574  df-opab 4634  df-mpt 4635  df-id 4939  df-xp 5030  df-rel 5031  df-cnv 5032  df-co 5033  df-dm 5034  df-res 5036  df-iota 5750  df-fun 5788  df-fv 5794  df-ust 21752
This theorem is referenced by:  ustssco  21766  ustref  21770  ustelimasn  21774  trust  21781  ustuqtop3  21795
  Copyright terms: Public domain W3C validator