| 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 6221 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅)) | |
| 2 | uniss 4869 | . . . 4 ⊢ (𝑅 ⊆ (dom 𝑅 × ran 𝑅) → ∪ 𝑅 ⊆ ∪ (dom 𝑅 × ran 𝑅)) | |
| 3 | uniss 4869 | . . . 4 ⊢ (∪ 𝑅 ⊆ ∪ (dom 𝑅 × ran 𝑅) → ∪ ∪ 𝑅 ⊆ ∪ ∪ (dom 𝑅 × ran 𝑅)) | |
| 4 | 1, 2, 3 | 3syl 18 | . . 3 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 ⊆ ∪ ∪ (dom 𝑅 × ran 𝑅)) |
| 5 | unixpss 5757 | . . 3 ⊢ ∪ ∪ (dom 𝑅 × ran 𝑅) ⊆ (dom 𝑅 ∪ ran 𝑅) | |
| 6 | 4, 5 | sstrdi 3950 | . 2 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 ⊆ (dom 𝑅 ∪ ran 𝑅)) |
| 7 | dmrnssfld 5919 | . . 3 ⊢ (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅 | |
| 8 | 7 | a1i 11 | . 2 ⊢ (Rel 𝑅 → (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅) |
| 9 | 6, 8 | eqssd 3955 | 1 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∪ cun 3903 ⊆ wss 3905 ∪ cuni 4861 × cxp 5621 dom cdm 5623 ran crn 5624 Rel wrel 5628 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3397 df-v 3440 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-br 5096 df-opab 5158 df-xp 5629 df-rel 5630 df-cnv 5631 df-dm 5633 df-rn 5634 |
| This theorem is referenced by: relresfld 6228 unidmrn 6231 relcnvfld 6232 unixp 6234 relexp0 14948 relexpfld 14974 rtrclreclem4 14986 dfrtrcl2 14987 lefld 18516 fvmptiunrelexplb0da 43661 |
| Copyright terms: Public domain | W3C validator |