| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relfld | Structured version Visualization version GIF version | ||
| Description: The double union of a relation is its field. (Contributed by NM, 17-Sep-2006.) |
| Ref | Expression |
|---|---|
| relfld | ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relssdmrn 6220 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅)) | |
| 2 | uniss 4846 | . . . 4 ⊢ (𝑅 ⊆ (dom 𝑅 × ran 𝑅) → ∪ 𝑅 ⊆ ∪ (dom 𝑅 × ran 𝑅)) | |
| 3 | uniss 4846 | . . . 4 ⊢ (∪ 𝑅 ⊆ ∪ (dom 𝑅 × ran 𝑅) → ∪ ∪ 𝑅 ⊆ ∪ ∪ (dom 𝑅 × ran 𝑅)) | |
| 4 | 1, 2, 3 | 3syl 18 | . . 3 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 ⊆ ∪ ∪ (dom 𝑅 × ran 𝑅)) |
| 5 | unixpss 5753 | . . 3 ⊢ ∪ ∪ (dom 𝑅 × ran 𝑅) ⊆ (dom 𝑅 ∪ ran 𝑅) | |
| 6 | 4, 5 | sstrdi 3927 | . 2 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 ⊆ (dom 𝑅 ∪ ran 𝑅)) |
| 7 | dmrnssfld 5916 | . . 3 ⊢ (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅 | |
| 8 | 7 | a1i 11 | . 2 ⊢ (Rel 𝑅 → (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅) |
| 9 | 6, 8 | eqssd 3932 | 1 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∪ cun 3881 ⊆ wss 3883 ∪ cuni 4838 × cxp 5616 dom cdm 5618 ran crn 5619 Rel wrel 5623 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-xp 5624 df-rel 5625 df-cnv 5626 df-dm 5628 df-rn 5629 |
| This theorem is referenced by: relresfld 6227 unidmrn 6230 relcnvfld 6231 unixp 6233 relexp0 14976 relexpfld 15002 rtrclreclem4 15014 dfrtrcl2 15015 lefld 18549 fvmptiunrelexplb0da 44129 |
| Copyright terms: Public domain | W3C validator |