| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > relfld | 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 5264 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅)) | |
| 2 | uniss 3919 | . . . 4 ⊢ (𝑅 ⊆ (dom 𝑅 × ran 𝑅) → ∪ 𝑅 ⊆ ∪ (dom 𝑅 × ran 𝑅)) | |
| 3 | uniss 3919 | . . . 4 ⊢ (∪ 𝑅 ⊆ ∪ (dom 𝑅 × ran 𝑅) → ∪ ∪ 𝑅 ⊆ ∪ ∪ (dom 𝑅 × ran 𝑅)) | |
| 4 | 1, 2, 3 | 3syl 17 | . . 3 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 ⊆ ∪ ∪ (dom 𝑅 × ran 𝑅)) |
| 5 | unixpss 4845 | . . 3 ⊢ ∪ ∪ (dom 𝑅 × ran 𝑅) ⊆ (dom 𝑅 ∪ ran 𝑅) | |
| 6 | 4, 5 | sstrdi 3240 | . 2 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 ⊆ (dom 𝑅 ∪ ran 𝑅)) |
| 7 | dmrnssfld 5001 | . . 3 ⊢ (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅 | |
| 8 | 7 | a1i 9 | . 2 ⊢ (Rel 𝑅 → (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅) |
| 9 | 6, 8 | eqssd 3245 | 1 ⊢ (Rel 𝑅 → ∪ ∪ 𝑅 = (dom 𝑅 ∪ ran 𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∪ cun 3199 ⊆ wss 3201 ∪ cuni 3898 × cxp 4729 dom cdm 4731 ran crn 4732 Rel wrel 4736 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-xp 4737 df-rel 4738 df-cnv 4739 df-dm 4741 df-rn 4742 |
| This theorem is referenced by: relresfld 5273 relcoi1 5275 unidmrn 5276 relcnvfld 5277 unixpm 5279 |
| Copyright terms: Public domain | W3C validator |