| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rnun | GIF version | ||
| Description: Distributive law for range over union. Theorem 8 of [Suppes] p. 60. (Contributed by NM, 24-Mar-1998.) |
| Ref | Expression |
|---|---|
| rnun | ⊢ ran (𝐴 ∪ 𝐵) = (ran 𝐴 ∪ ran 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvun 5134 | . . . 4 ⊢ ◡(𝐴 ∪ 𝐵) = (◡𝐴 ∪ ◡𝐵) | |
| 2 | 1 | dmeqi 4924 | . . 3 ⊢ dom ◡(𝐴 ∪ 𝐵) = dom (◡𝐴 ∪ ◡𝐵) |
| 3 | dmun 4930 | . . 3 ⊢ dom (◡𝐴 ∪ ◡𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) | |
| 4 | 2, 3 | eqtri 2250 | . 2 ⊢ dom ◡(𝐴 ∪ 𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) |
| 5 | df-rn 4730 | . 2 ⊢ ran (𝐴 ∪ 𝐵) = dom ◡(𝐴 ∪ 𝐵) | |
| 6 | df-rn 4730 | . . 3 ⊢ ran 𝐴 = dom ◡𝐴 | |
| 7 | df-rn 4730 | . . 3 ⊢ ran 𝐵 = dom ◡𝐵 | |
| 8 | 6, 7 | uneq12i 3356 | . 2 ⊢ (ran 𝐴 ∪ ran 𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) |
| 9 | 4, 5, 8 | 3eqtr4i 2260 | 1 ⊢ ran (𝐴 ∪ 𝐵) = (ran 𝐴 ∪ ran 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1395 ∪ cun 3195 ◡ccnv 4718 dom cdm 4719 ran crn 4720 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-sn 3672 df-pr 3673 df-op 3675 df-br 4084 df-opab 4146 df-cnv 4727 df-dm 4729 df-rn 4730 |
| This theorem is referenced by: imaundi 5141 imaundir 5142 rnpropg 5208 fun 5499 foun 5593 fpr 5825 fprg 5826 sbthlemi6 7137 exmidfodomrlemim 7387 |
| Copyright terms: Public domain | W3C validator |