| 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 5144 | . . . 4 ⊢ ◡(𝐴 ∪ 𝐵) = (◡𝐴 ∪ ◡𝐵) | |
| 2 | 1 | dmeqi 4934 | . . 3 ⊢ dom ◡(𝐴 ∪ 𝐵) = dom (◡𝐴 ∪ ◡𝐵) |
| 3 | dmun 4940 | . . 3 ⊢ dom (◡𝐴 ∪ ◡𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) | |
| 4 | 2, 3 | eqtri 2251 | . 2 ⊢ dom ◡(𝐴 ∪ 𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) |
| 5 | df-rn 4738 | . 2 ⊢ ran (𝐴 ∪ 𝐵) = dom ◡(𝐴 ∪ 𝐵) | |
| 6 | df-rn 4738 | . . 3 ⊢ ran 𝐴 = dom ◡𝐴 | |
| 7 | df-rn 4738 | . . 3 ⊢ ran 𝐵 = dom ◡𝐵 | |
| 8 | 6, 7 | uneq12i 3358 | . 2 ⊢ (ran 𝐴 ∪ ran 𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) |
| 9 | 4, 5, 8 | 3eqtr4i 2261 | 1 ⊢ ran (𝐴 ∪ 𝐵) = (ran 𝐴 ∪ ran 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1397 ∪ cun 3197 ◡ccnv 4726 dom cdm 4727 ran crn 4728 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2212 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1810 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-v 2803 df-un 3203 df-in 3205 df-ss 3212 df-sn 3676 df-pr 3677 df-op 3679 df-br 4090 df-opab 4152 df-cnv 4735 df-dm 4737 df-rn 4738 |
| This theorem is referenced by: imaundi 5151 imaundir 5152 rnpropg 5218 fun 5510 foun 5605 fpr 5839 fprg 5840 sbthlemi6 7166 exmidfodomrlemim 7417 |
| Copyright terms: Public domain | W3C validator |