| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ustbas | Structured version Visualization version GIF version | ||
| Description: Recover the base of a uniform structure 𝑈. ∪ ran UnifOn is to UnifOn what Top is to TopOn. (Contributed by Thierry Arnoux, 16-Nov-2017.) |
| Ref | Expression |
|---|---|
| ustbas.1 | ⊢ 𝑋 = dom ∪ 𝑈 |
| Ref | Expression |
|---|---|
| ustbas | ⊢ (𝑈 ∈ ∪ ran UnifOn ↔ 𝑈 ∈ (UnifOn‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ustfn 24551 | . . . 4 ⊢ UnifOn Fn V | |
| 2 | fnfun 6661 | . . . 4 ⊢ (UnifOn Fn V → Fun UnifOn) | |
| 3 | elunirn 7278 | . . . 4 ⊢ (Fun UnifOn → (𝑈 ∈ ∪ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥))) | |
| 4 | 1, 2, 3 | mp2b 10 | . . 3 ⊢ (𝑈 ∈ ∪ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥)) |
| 5 | ustbas2 24574 | . . . . . . . 8 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → 𝑥 = dom ∪ 𝑈) | |
| 6 | ustbas.1 | . . . . . . . 8 ⊢ 𝑋 = dom ∪ 𝑈 | |
| 7 | 5, 6 | eqtr4di 2816 | . . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → 𝑥 = 𝑋) |
| 8 | 7 | fveq2d 6912 | . . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → (UnifOn‘𝑥) = (UnifOn‘𝑋)) |
| 9 | 8 | eleq2d 2850 | . . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → (𝑈 ∈ (UnifOn‘𝑥) ↔ 𝑈 ∈ (UnifOn‘𝑋))) |
| 10 | 9 | ibi 270 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → 𝑈 ∈ (UnifOn‘𝑋)) |
| 11 | 10 | rexlimivw 3163 | . . 3 ⊢ (∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥) → 𝑈 ∈ (UnifOn‘𝑋)) |
| 12 | 4, 11 | sylbi 220 | . 2 ⊢ (𝑈 ∈ ∪ ran UnifOn → 𝑈 ∈ (UnifOn‘𝑋)) |
| 13 | elfvunirn 6938 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ∈ ∪ ran UnifOn) | |
| 14 | 12, 13 | impbii 212 | 1 ⊢ (𝑈 ∈ ∪ ran UnifOn ↔ 𝑈 ∈ (UnifOn‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 Vcvv 3454 ∪ cuni 4870 dom cdm 5655 ran crn 5656 Fun wfun 6552 Fn wfn 6553 ‘cfv 6558 UnifOncust 24549 |
| 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 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| 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 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-iota 6512 df-fun 6560 df-fn 6561 df-fv 6566 df-ust 24550 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |