| 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 23879 | . 2 ⊢ Ref = {〈𝑥, 𝑦〉 ∣ (∪ 𝑦 = ∪ 𝑥 ∧ ∀𝑧 ∈ 𝑥 ∃𝑤 ∈ 𝑦 𝑧 ⊆ 𝑤)} | |
| 2 | 1 | relopabi 5809 | 1 ⊢ Rel Ref |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 ∪ cuni 4872 Rel wrel 5663 Refcref 23876 |
| 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-ext 2735 |
| 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-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-opab 5174 df-xp 5664 df-rel 5665 df-ref 23879 |
| This theorem is used by: isref 23883 refbas 23884 refssex 23885 reftr 23888 refun0 23889 locfinref 34584 refssfne 37361 |
| Copyright terms: Public domain | W3C validator |