Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > imaundi | GIF version |
Description: Distributive law for image over union. Theorem 35 of [Suppes] p. 65. (Contributed by NM, 30-Sep-2002.) |
Ref | Expression |
---|---|
imaundi | ⊢ (𝐴 “ (𝐵 ∪ 𝐶)) = ((𝐴 “ 𝐵) ∪ (𝐴 “ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resundi 4832 | . . . 4 ⊢ (𝐴 ↾ (𝐵 ∪ 𝐶)) = ((𝐴 ↾ 𝐵) ∪ (𝐴 ↾ 𝐶)) | |
2 | 1 | rneqi 4767 | . . 3 ⊢ ran (𝐴 ↾ (𝐵 ∪ 𝐶)) = ran ((𝐴 ↾ 𝐵) ∪ (𝐴 ↾ 𝐶)) |
3 | rnun 4947 | . . 3 ⊢ ran ((𝐴 ↾ 𝐵) ∪ (𝐴 ↾ 𝐶)) = (ran (𝐴 ↾ 𝐵) ∪ ran (𝐴 ↾ 𝐶)) | |
4 | 2, 3 | eqtri 2160 | . 2 ⊢ ran (𝐴 ↾ (𝐵 ∪ 𝐶)) = (ran (𝐴 ↾ 𝐵) ∪ ran (𝐴 ↾ 𝐶)) |
5 | df-ima 4552 | . 2 ⊢ (𝐴 “ (𝐵 ∪ 𝐶)) = ran (𝐴 ↾ (𝐵 ∪ 𝐶)) | |
6 | df-ima 4552 | . . 3 ⊢ (𝐴 “ 𝐵) = ran (𝐴 ↾ 𝐵) | |
7 | df-ima 4552 | . . 3 ⊢ (𝐴 “ 𝐶) = ran (𝐴 ↾ 𝐶) | |
8 | 6, 7 | uneq12i 3228 | . 2 ⊢ ((𝐴 “ 𝐵) ∪ (𝐴 “ 𝐶)) = (ran (𝐴 ↾ 𝐵) ∪ ran (𝐴 ↾ 𝐶)) |
9 | 4, 5, 8 | 3eqtr4i 2170 | 1 ⊢ (𝐴 “ (𝐵 ∪ 𝐶)) = ((𝐴 “ 𝐵) ∪ (𝐴 “ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: = wceq 1331 ∪ cun 3069 ran crn 4540 ↾ cres 4541 “ cima 4542 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-v 2688 df-un 3075 df-in 3077 df-ss 3084 df-sn 3533 df-pr 3534 df-op 3536 df-br 3930 df-opab 3990 df-xp 4545 df-cnv 4547 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 |
This theorem is referenced by: fnimapr 5481 fiintim 6817 fidcenumlemrks 6841 fidcenumlemr 6843 resunimafz0 10574 ennnfonelemhf1o 11926 |
Copyright terms: Public domain | W3C validator |