![]() |
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 5072 | . . . 4 ⊢ ◡(𝐴 ∪ 𝐵) = (◡𝐴 ∪ ◡𝐵) | |
2 | 1 | dmeqi 4864 | . . 3 ⊢ dom ◡(𝐴 ∪ 𝐵) = dom (◡𝐴 ∪ ◡𝐵) |
3 | dmun 4870 | . . 3 ⊢ dom (◡𝐴 ∪ ◡𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) | |
4 | 2, 3 | eqtri 2214 | . 2 ⊢ dom ◡(𝐴 ∪ 𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) |
5 | df-rn 4671 | . 2 ⊢ ran (𝐴 ∪ 𝐵) = dom ◡(𝐴 ∪ 𝐵) | |
6 | df-rn 4671 | . . 3 ⊢ ran 𝐴 = dom ◡𝐴 | |
7 | df-rn 4671 | . . 3 ⊢ ran 𝐵 = dom ◡𝐵 | |
8 | 6, 7 | uneq12i 3312 | . 2 ⊢ (ran 𝐴 ∪ ran 𝐵) = (dom ◡𝐴 ∪ dom ◡𝐵) |
9 | 4, 5, 8 | 3eqtr4i 2224 | 1 ⊢ ran (𝐴 ∪ 𝐵) = (ran 𝐴 ∪ ran 𝐵) |
Colors of variables: wff set class |
Syntax hints: = wceq 1364 ∪ cun 3152 ◡ccnv 4659 dom cdm 4660 ran crn 4661 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2175 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-v 2762 df-un 3158 df-in 3160 df-ss 3167 df-sn 3625 df-pr 3626 df-op 3628 df-br 4031 df-opab 4092 df-cnv 4668 df-dm 4670 df-rn 4671 |
This theorem is referenced by: imaundi 5079 imaundir 5080 rnpropg 5146 fun 5427 foun 5520 fpr 5741 fprg 5742 sbthlemi6 7023 exmidfodomrlemim 7263 |
Copyright terms: Public domain | W3C validator |