![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > iunpreima | Structured version Visualization version GIF version |
Description: Preimage of an indexed union. (Contributed by Thierry Arnoux, 27-Mar-2018.) |
Ref | Expression |
---|---|
iunpreima | ⊢ (Fun 𝐹 → (◡𝐹 “ ∪ 𝑥 ∈ 𝐴 𝐵) = ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eliun 4823 | . . . . 5 ⊢ ((𝐹‘𝑦) ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐵) | |
2 | 1 | a1i 11 | . . . 4 ⊢ (Fun 𝐹 → ((𝐹‘𝑦) ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐵)) |
3 | 2 | rabbidv 3420 | . . 3 ⊢ (Fun 𝐹 → {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ ∪ 𝑥 ∈ 𝐴 𝐵} = {𝑦 ∈ dom 𝐹 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐵}) |
4 | funfn 6247 | . . . 4 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
5 | fncnvima2 6687 | . . . 4 ⊢ (𝐹 Fn dom 𝐹 → (◡𝐹 “ ∪ 𝑥 ∈ 𝐴 𝐵) = {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ ∪ 𝑥 ∈ 𝐴 𝐵}) | |
6 | 4, 5 | sylbi 218 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ ∪ 𝑥 ∈ 𝐴 𝐵) = {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ ∪ 𝑥 ∈ 𝐴 𝐵}) |
7 | iunrab 4869 | . . . 4 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ 𝐵} = {𝑦 ∈ dom 𝐹 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐵} | |
8 | 7 | a1i 11 | . . 3 ⊢ (Fun 𝐹 → ∪ 𝑥 ∈ 𝐴 {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ 𝐵} = {𝑦 ∈ dom 𝐹 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝐵}) |
9 | 3, 6, 8 | 3eqtr4d 2839 | . 2 ⊢ (Fun 𝐹 → (◡𝐹 “ ∪ 𝑥 ∈ 𝐴 𝐵) = ∪ 𝑥 ∈ 𝐴 {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ 𝐵}) |
10 | fncnvima2 6687 | . . . 4 ⊢ (𝐹 Fn dom 𝐹 → (◡𝐹 “ 𝐵) = {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ 𝐵}) | |
11 | 4, 10 | sylbi 218 | . . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ 𝐵) = {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ 𝐵}) |
12 | 11 | iuneq2d 4847 | . 2 ⊢ (Fun 𝐹 → ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝐵) = ∪ 𝑥 ∈ 𝐴 {𝑦 ∈ dom 𝐹 ∣ (𝐹‘𝑦) ∈ 𝐵}) |
13 | 9, 12 | eqtr4d 2832 | 1 ⊢ (Fun 𝐹 → (◡𝐹 “ ∪ 𝑥 ∈ 𝐴 𝐵) = ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 = wceq 1520 ∈ wcel 2079 ∃wrex 3104 {crab 3107 ∪ ciun 4819 ◡ccnv 5434 dom cdm 5435 “ cima 5438 Fun wfun 6211 Fn wfn 6212 ‘cfv 6217 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1775 ax-4 1789 ax-5 1886 ax-6 1945 ax-7 1990 ax-8 2081 ax-9 2089 ax-10 2110 ax-11 2124 ax-12 2139 ax-13 2342 ax-ext 2767 ax-sep 5088 ax-nul 5095 ax-pr 5214 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3an 1080 df-tru 1523 df-ex 1760 df-nf 1764 df-sb 2041 df-mo 2574 df-eu 2610 df-clab 2774 df-cleq 2786 df-clel 2861 df-nfc 2933 df-ne 2983 df-ral 3108 df-rex 3109 df-rab 3112 df-v 3434 df-sbc 3702 df-dif 3857 df-un 3859 df-in 3861 df-ss 3869 df-nul 4207 df-if 4376 df-sn 4467 df-pr 4469 df-op 4473 df-uni 4740 df-iun 4821 df-br 4957 df-opab 5019 df-id 5340 df-xp 5441 df-rel 5442 df-cnv 5443 df-co 5444 df-dm 5445 df-rn 5446 df-res 5447 df-ima 5448 df-iota 6181 df-fun 6219 df-fn 6220 df-fv 6225 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |