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

Theorem ustbas 24551
Description: Recover the base of an uniform structure 𝑈. ∪ ran UnifOn is to UnifOn what Top is to TopOn. (Contributed by Thierry Arnoux, 16-Nov-2017.)
Hypothesis
Ref Expression
ustbas.1 𝑋 = dom ∪ 𝑈
Assertion
Ref Expression
ustbas (𝑈 ∈ ∪ ran UnifOn ↔ 𝑈 ∈ (UnifOn‘𝑋))

Proof of Theorem ustbas
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ustfn 24526 . . . 4 UnifOn Fn V
2 fnfun 6639 . . . 4 (UnifOn Fn V → Fun UnifOn)
3 elunirn 7255 . . . 4 (Fun UnifOn → (𝑈 ∈ ∪ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥)))
41, 2, 3mp2b 10 . . 3 (𝑈 ∈ ∪ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥))
5 ustbas2 24549 . . . . . . . 8 (𝑈 ∈ (UnifOn‘𝑥) → 𝑥 = dom ∪ 𝑈)
6 ustbas.1 . . . . . . . 8 𝑋 = dom ∪ 𝑈
75, 6eqtr4di 2813 . . . . . . 7 (𝑈 ∈ (UnifOn‘𝑥) → 𝑥 = 𝑋)
87fveq2d 6889 . . . . . 6 (𝑈 ∈ (UnifOn‘𝑥) → (UnifOn‘𝑥) = (UnifOn‘𝑋))
98eleq2d 2846 . . . . 5 (𝑈 ∈ (UnifOn‘𝑥) → (𝑈 ∈ (UnifOn‘𝑥) ↔ 𝑈 ∈ (UnifOn‘𝑋)))
109ibi 270 . . . 4 (𝑈 ∈ (UnifOn‘𝑥) → 𝑈 ∈ (UnifOn‘𝑋))
1110rexlimivw 3159 . . 3 (∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥) → 𝑈 ∈ (UnifOn‘𝑋))
124, 11sylbi 220 . 2 (𝑈 ∈ ∪ ran UnifOn → 𝑈 ∈ (UnifOn‘𝑋))
13 elfvunirn 6915 . 2 (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ∈ ∪ ran UnifOn)
1412, 13impbii 212 1 (𝑈 ∈ ∪ ran UnifOn ↔ 𝑈 ∈ (UnifOn‘𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450  ∪ cuni 4866  dom cdm 5650  ran crn 5651  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538  UnifOncust 24524
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546  df-ust 24525
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator