| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > uniimaprimaeqfv | Structured version Visualization version GIF version | ||
| Description: The union of the image of the preimage of a function value is the function value. (Contributed by AV, 12-Mar-2024.) |
| Ref | Expression |
|---|---|
| uniimaprimaeqfv | ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑋)})) = (𝐹‘𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dffn3 6684 | . . . . 5 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹) | |
| 2 | 1 | biimpi 216 | . . . 4 ⊢ (𝐹 Fn 𝐴 → 𝐹:𝐴⟶ran 𝐹) |
| 3 | 2 | adantr 480 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝐹:𝐴⟶ran 𝐹) |
| 4 | cnvimass 6051 | . . . . 5 ⊢ (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ dom 𝐹 | |
| 5 | fndm 6605 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 6 | 4, 5 | sseqtrid 3978 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ 𝐴) |
| 7 | 6 | adantr 480 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ 𝐴) |
| 8 | preimafvsnel 47768 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)})) | |
| 9 | 3, 7, 8 | 3jca 1129 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹:𝐴⟶ran 𝐹 ∧ (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ 𝐴 ∧ 𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)}))) |
| 10 | fniniseg 7016 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)}) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐹‘𝑋)))) | |
| 11 | 10 | adantr 480 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)}) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐹‘𝑋)))) |
| 12 | simpr 484 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐹‘𝑋)) → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
| 13 | 11, 12 | biimtrdi 253 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)}) → (𝐹‘𝑥) = (𝐹‘𝑋))) |
| 14 | 13 | ralrimiv 3129 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ∀𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)})(𝐹‘𝑥) = (𝐹‘𝑋)) |
| 15 | uniimafveqt 47770 | . 2 ⊢ ((𝐹:𝐴⟶ran 𝐹 ∧ (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ 𝐴 ∧ 𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)})) → (∀𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)})(𝐹‘𝑥) = (𝐹‘𝑋) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑋)})) = (𝐹‘𝑋))) | |
| 16 | 9, 14, 15 | sylc 65 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑋)})) = (𝐹‘𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ⊆ wss 3903 {csn 4582 ∪ cuni 4865 ◡ccnv 5633 dom cdm 5634 ran crn 5635 “ cima 5637 Fn wfn 6497 ⟶wf 6498 ‘cfv 6502 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pr 5381 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-fv 6510 |
| This theorem is referenced by: imasetpreimafvbijlemfo 47794 fundcmpsurbijinjpreimafv 47796 |
| Copyright terms: Public domain | W3C validator |