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

Theorem ustinvel 24200
Description: If 𝑉 is an entourage, so is its inverse. Condition UII of [BourbakiTop1] p. II.1. (Contributed by Thierry Arnoux, 2-Dec-2017.)
Assertion
Ref Expression
ustinvel ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉𝑈)

Proof of Theorem ustinvel
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvex 6869 . . . . . . 7 (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
2 isust 24194 . . . . . . 7 (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
31, 2syl 17 . . . . . 6 (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
43ibi 268 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))))
54simp3d 1150 . . . 4 (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))
6 sseq1 3947 . . . . . . . 8 (𝑣 = 𝑉 → (𝑣𝑤𝑉𝑤))
76imbi1d 342 . . . . . . 7 (𝑣 = 𝑉 → ((𝑣𝑤𝑤𝑈) ↔ (𝑉𝑤𝑤𝑈)))
87ralbidv 3163 . . . . . 6 (𝑣 = 𝑉 → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ↔ ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈)))
9 ineq1 4149 . . . . . . . 8 (𝑣 = 𝑉 → (𝑣𝑤) = (𝑉𝑤))
109eleq1d 2825 . . . . . . 7 (𝑣 = 𝑉 → ((𝑣𝑤) ∈ 𝑈 ↔ (𝑉𝑤) ∈ 𝑈))
1110ralbidv 3163 . . . . . 6 (𝑣 = 𝑉 → (∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ↔ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈))
12 sseq2 3948 . . . . . . 7 (𝑣 = 𝑉 → (( I ↾ 𝑋) ⊆ 𝑣 ↔ ( I ↾ 𝑋) ⊆ 𝑉))
13 cnveq 5822 . . . . . . . 8 (𝑣 = 𝑉𝑣 = 𝑉)
1413eleq1d 2825 . . . . . . 7 (𝑣 = 𝑉 → (𝑣𝑈𝑉𝑈))
15 sseq2 3948 . . . . . . . 8 (𝑣 = 𝑉 → ((𝑤𝑤) ⊆ 𝑣 ↔ (𝑤𝑤) ⊆ 𝑉))
1615rexbidv 3164 . . . . . . 7 (𝑣 = 𝑉 → (∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣 ↔ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))
1712, 14, 163anbi123d 1444 . . . . . 6 (𝑣 = 𝑉 → ((( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣) ↔ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉)))
188, 11, 173anbi123d 1444 . . . . 5 (𝑣 = 𝑉 → ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) ↔ (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))))
1918rspcv 3563 . . . 4 (𝑉𝑈 → (∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))))
205, 19mpan9 511 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉)))
2120simp3d 1150 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))
2221simp2d 1149 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  wral 3054  wrex 3064  Vcvv 3432  cin 3889  wss 3890  𝒫 cpw 4536   I cid 5519   × cxp 5623  ccnv 5624  cres 5627  ccom 5629  cfv 6492  UnifOncust 24190
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-res 5637  df-iota 6448  df-fun 6494  df-fv 6500  df-ust 24191
This theorem is referenced by:  ustexsym  24206  trust  24219
  Copyright terms: Public domain W3C validator