| 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 6710 | . . . 4 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹) | |
| 2 | 1 | birani 509 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝐹:𝐴⟶ran 𝐹) |
| 3 | cnvimass 6072 | . . . . 5 ⊢ (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ dom 𝐹 | |
| 4 | fndm 6630 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 5 | 3, 4 | sseqtrid 3972 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ 𝐴) |
| 6 | 5 | adantr 486 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ 𝐴) |
| 7 | preimafvsnel 48383 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)})) | |
| 8 | 2, 6, 7 | 3jca 1146 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹:𝐴⟶ran 𝐹 ∧ (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ 𝐴 ∧ 𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)}))) |
| 9 | fniniseg 7047 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)}) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐹‘𝑋)))) | |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)}) ↔ (𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐹‘𝑋)))) |
| 11 | simpr 490 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝐹‘𝑥) = (𝐹‘𝑋)) → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
| 12 | 10, 11 | biimtrdi 256 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)}) → (𝐹‘𝑥) = (𝐹‘𝑋))) |
| 13 | 12 | ralrimiv 3153 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ∀𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)})(𝐹‘𝑥) = (𝐹‘𝑋)) |
| 14 | uniimafveqt 48385 | . 2 ⊢ ((𝐹:𝐴⟶ran 𝐹 ∧ (◡𝐹 “ {(𝐹‘𝑋)}) ⊆ 𝐴 ∧ 𝑋 ∈ (◡𝐹 “ {(𝐹‘𝑋)})) → (∀𝑥 ∈ (◡𝐹 “ {(𝐹‘𝑋)})(𝐹‘𝑥) = (𝐹‘𝑋) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑋)})) = (𝐹‘𝑋))) | |
| 15 | 8, 13, 14 | sylc 66 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑋)})) = (𝐹‘𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ⊆ wss 3898 {csn 4583 ∪ cuni 4866 ◡ccnv 5646 dom cdm 5647 ran crn 5648 “ cima 5650 Fn wfn 6522 ⟶wf 6523 ‘cfv 6527 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-fv 6535 |
| This theorem is used by: imasetpreimafvbijlemfo 48409 fundcmpsurbijinjpreimafv 48411 |
| Copyright terms: Public domain | W3C validator |