| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > refrel | Structured version Visualization version GIF version | ||
| Description: Refinement is a relation. (Contributed by Jeff Hankins, 18-Jan-2010.) (Revised by Thierry Arnoux, 3-Feb-2020.) |
| Ref | Expression |
|---|---|
| refrel | ⊢ Rel Ref |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ref 23817 | . 2 ⊢ Ref = {〈𝑥, 𝑦〉 ∣ (∪ 𝑦 = ∪ 𝑥 ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤)} | |
| 2 | 1 | relopabiv 5798 | 1 ⊢ Rel Ref |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∀wral 3077 ∃wrex 3087 ⊆ wss 3899 ∪ cuni 4867 Rel wrel 5656 Refcref 23814 |
| 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-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3453 df-ss 3916 df-opab 5168 df-xp 5657 df-rel 5658 df-ref 23817 |
| This theorem is used by: isref 23821 refbas 23822 refssex 23823 reftr 23826 refun0 23827 locfinref 34466 refssfne 37126 |
| Copyright terms: Public domain | W3C validator |