| 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 an 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 24340 | . . . 4 ⊢ UnifOn Fn V | |
| 2 | fnfun 6637 | . . . 4 ⊢ (UnifOn Fn V → Fun UnifOn) | |
| 3 | elunirn 7251 | . . . 4 ⊢ (Fun UnifOn → (𝑈 ∈ ∪ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥))) | |
| 4 | 1, 2, 3 | mp2b 10 | . . 3 ⊢ (𝑈 ∈ ∪ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥)) |
| 5 | ustbas2 24363 | . . . . . . . 8 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → 𝑥 = dom ∪ 𝑈) | |
| 6 | ustbas.1 | . . . . . . . 8 ⊢ 𝑋 = dom ∪ 𝑈 | |
| 7 | 5, 6 | eqtr4di 2816 | . . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → 𝑥 = 𝑋) |
| 8 | 7 | fveq2d 6887 | . . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → (UnifOn‘𝑥) = (UnifOn‘𝑋)) |
| 9 | 8 | eleq2d 2849 | . . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → (𝑈 ∈ (UnifOn‘𝑥) ↔ 𝑈 ∈ (UnifOn‘𝑋))) |
| 10 | 9 | ibi 270 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑥) → 𝑈 ∈ (UnifOn‘𝑋)) |
| 11 | 10 | rexlimivw 3162 | . . 3 ⊢ (∃𝑥 ∈ dom UnifOn𝑈 ∈ (UnifOn‘𝑥) → 𝑈 ∈ (UnifOn‘𝑋)) |
| 12 | 4, 11 | sylbi 220 | . 2 ⊢ (𝑈 ∈ ∪ ran UnifOn → 𝑈 ∈ (UnifOn‘𝑋)) |
| 13 | elfvunirn 6913 | . 2 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑈 ∈ ∪ ran UnifOn) | |
| 14 | 12, 13 | impbii 212 | 1 ⊢ (𝑈 ∈ ∪ ran UnifOn ↔ 𝑈 ∈ (UnifOn‘𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 = wceq 1570 ∈ wcel 2143 ∃wrex 3089 Vcvv 3455 ∪ cuni 4873 dom cdm 5663 ran crn 5664 Fun wfun 6532 Fn wfn 6533 ‘cfv 6538 UnifOncust 24338 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-iota 6494 df-fun 6540 df-fn 6541 df-fv 6546 df-ust 24339 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |