| 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 5167 | . . . 4 ⊢ ◡(𝐴 ∪ 𝐵) = (◡𝐴 ∪ ◡𝐵) | |
| 2 | 1 | dmeqi 4956 | . . 3 ⊢ dom ◡(𝐴 ∪ 𝐵) = dom (◡𝐴 ∪ ◡𝐵) |
| 3 | dmun 4962 | . . 3 ⊢ dom (◡𝐴 ∪ ◡𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) | |
| 4 | 2, 3 | eqtri 2253 | . 2 ⊢ dom ◡(𝐴 ∪ 𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) |
| 5 | df-rn 4759 | . 2 ⊢ ran (𝐴 ∪ 𝐵) = dom ◡(𝐴 ∪ 𝐵) | |
| 6 | df-rn 4759 | . . 3 ⊢ ran 𝐴 = dom ◡𝐴 | |
| 7 | df-rn 4759 | . . 3 ⊢ ran 𝐵 = dom ◡𝐵 | |
| 8 | 6, 7 | uneq12i 3370 | . 2 ⊢ (ran 𝐴 ∪ ran 𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) |
| 9 | 4, 5, 8 | 3eqtr4i 2263 | 1 ⊢ ran (𝐴 ∪ 𝐵) = (ran 𝐴 ∪ ran 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1398 ∪ cun 3208 ◡ccnv 4747 dom cdm 4748 ran crn 4749 |
| 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-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2814 df-un 3214 df-in 3216 df-ss 3223 df-sn 3694 df-pr 3695 df-op 3697 df-br 4109 df-opab 4171 df-cnv 4756 df-dm 4758 df-rn 4759 |
| This theorem is referenced by: imaundi 5174 imaundir 5175 rnpropg 5241 fun 5535 foun 5632 fpr 5865 fprg 5866 sbthlemi6 7231 exmidfodomrlemim 7503 |
| Copyright terms: Public domain | W3C validator |