Theorem ustref 24593

Description: Any element of the base set is "near" itself, i.e. entourages are reflexive. (Contributed by Thierry Arnoux, 16-Nov-2017.)

Assertion

Ref	Expression
ustref	⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝐴 ∈ 𝑋) → 𝐴𝑉𝐴)

Proof of Theorem ustref

Step	Hyp	Ref	Expression
1		eqid 2763	. . . . 5 ⊢ 𝐴 = 𝐴
2		resieq 5997	. . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴( I ↾ 𝑋)𝐴 ↔ 𝐴 = 𝐴))
3	1, 2	mpbiri 261	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴( I ↾ 𝑋)𝐴)
4	3	anidms 577	. . 3 ⊢ (𝐴 ∈ 𝑋 → 𝐴( I ↾ 𝑋)𝐴)
5	4	3ad2ant3 1153	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝐴 ∈ 𝑋) → 𝐴( I ↾ 𝑋)𝐴)
6		ustdiag 24583	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → ( I ↾ 𝑋) ⊆ 𝑉)
7	6	ssbrd 5154	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → (𝐴( I ↾ 𝑋)𝐴 → 𝐴𝑉𝐴))
8	7	3adant3 1150	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝐴 ∈ 𝑋) → (𝐴( I ↾ 𝑋)𝐴 → 𝐴𝑉𝐴))
9	5, 8	mpd 16	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝐴 ∈ 𝑋) → 𝐴𝑉𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   class class class wbr 5108   I cid 5552   ↾ cres 5660  ‘cfv 6566  UnifOncust 24574

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-res 5670  df-iota 6520  df-fun 6568  df-fv 6574  df-ust 24575

This theorem is used by:  cstucnd  24657