Theorem ustinvel 23361

Description: If 𝑉 is an entourage, so is its inverse. Condition U_II 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.

Step	Hyp	Ref	Expression
1		elfvex 6807	. . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
2		isust 23355	. . . . . . 7 ⊢ (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))))
3	1, 2	syl 17	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))))
4	3	ibi 266	. . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣))))
5	4	simp3d 1143	. . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)))
6		sseq1 3946	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (𝑣 ⊆ 𝑤 ↔ 𝑉 ⊆ 𝑤))
7	6	imbi1d 342	. . . . . . 7 ⊢ (𝑣 = 𝑉 → ((𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ↔ (𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈)))
8	7	ralbidv 3112	. . . . . 6 ⊢ (𝑣 = 𝑉 → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ↔ ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈)))
9		ineq1 4139	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (𝑣 ∩ 𝑤) = (𝑉 ∩ 𝑤))
10	9	eleq1d 2823	. . . . . . 7 ⊢ (𝑣 = 𝑉 → ((𝑣 ∩ 𝑤) ∈ 𝑈 ↔ (𝑉 ∩ 𝑤) ∈ 𝑈))
11	10	ralbidv 3112	. . . . . 6 ⊢ (𝑣 = 𝑉 → (∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ↔ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈))
12		sseq2 3947	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (( I ↾ 𝑋) ⊆ 𝑣 ↔ ( I ↾ 𝑋) ⊆ 𝑉))
13		cnveq 5782	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → ◡𝑣 = ◡𝑉)
14	13	eleq1d 2823	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (◡𝑣 ∈ 𝑈 ↔ ◡𝑉 ∈ 𝑈))
15		sseq2 3947	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → ((𝑤 ∘ 𝑤) ⊆ 𝑣 ↔ (𝑤 ∘ 𝑤) ⊆ 𝑉))
16	15	rexbidv 3226	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣 ↔ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))
17	12, 14, 16	3anbi123d 1435	. . . . . 6 ⊢ (𝑣 = 𝑉 → ((( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣) ↔ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉)))
18	8, 11, 17	3anbi123d 1435	. . . . 5 ⊢ (𝑣 = 𝑉 → ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)) ↔ (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))))
19	18	rspcv 3557	. . . 4 ⊢ (𝑉 ∈ 𝑈 → (∀𝑣 ∈ 𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑣 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣 ∧ ◡𝑣 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑣)) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))))
20	5, 19	mpan9 507	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉 ⊆ 𝑤 → 𝑤 ∈ 𝑈) ∧ ∀𝑤 ∈ 𝑈 (𝑉 ∩ 𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉)))
21	20	simp3d 1143	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → (( I ↾ 𝑋) ⊆ 𝑉 ∧ ◡𝑉 ∈ 𝑈 ∧ ∃𝑤 ∈ 𝑈 (𝑤 ∘ 𝑤) ⊆ 𝑉))
22	21	simp2d 1142	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → ◡𝑉 ∈ 𝑈)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  ∀wral 3064  ∃wrex 3065  Vcvv 3432   ∩ cin 3886   ⊆ wss 3887  𝒫 cpw 4533   I cid 5488   × cxp 5587  ^◡ccnv 5588   ↾ cres 5591   ∘ ccom 5593  ‘cfv 6433  UnifOncust 23351

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-res 5601  df-iota 6391  df-fun 6435  df-fv 6441  df-ust 23352

This theorem is referenced by:  ustexsym  23367  trust  23381