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

Theorem ustbas 24526
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 24501 . . . 4 UnifOn Fn V
2 fnfun 6631 . . . 4 (UnifOn Fn V → Fun UnifOn)
3 elunirn 7247 . . . 4 (Fun UnifOn → (𝑈 ∈ ∪ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥)))
41, 2, 3mp2b 10 . . 3 (𝑈 ∈ ∪ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥))
5 ustbas2 24524 . . . . . . . 8 (𝑈 ∈ (UnifOn‘𝑥) → 𝑥 = dom ∪ 𝑈)
6 ustbas.1 . . . . . . . 8 𝑋 = dom ∪ 𝑈
75, 6eqtr4di 2814 . . . . . . 7 (𝑈 ∈ (UnifOn‘𝑥) → 𝑥 = 𝑋)
87fveq2d 6881 . . . . . 6 (𝑈 ∈ (UnifOn‘𝑥) → (UnifOn‘𝑥) = (UnifOn‘𝑋))
98eleq2d 2847 . . . . 5 (𝑈 ∈ (UnifOn‘𝑥) → (𝑈 ∈ (UnifOn‘𝑥) ↔ 𝑈 ∈ (UnifOn‘𝑋)))
109ibi 270 . . . 4 (𝑈 ∈ (UnifOn‘𝑥) → 𝑈 ∈ (UnifOn‘𝑋))
1110rexlimivw 3160 . . 3 (∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥) → 𝑈 ∈ (UnifOn‘𝑋))
124, 11sylbi 220 . 2 (𝑈 ∈ ∪ ran UnifOn → 𝑈 ∈ (UnifOn‘𝑋))
13 elfvunirn 6907 . 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 1570   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451  ∪ cuni 4867  dom cdm 5651  ran crn 5652  Fun wfun 6525   Fn wfn 6526  ‘cfv 6531  UnifOncust 24499
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539  df-ust 24500
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator