![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fvexg | GIF version |
Description: Evaluating a set function at a set exists. (Contributed by Mario Carneiro and Jim Kingdon, 28-May-2019.) |
Ref | Expression |
---|---|
fvexg | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝐹‘𝐴) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2748 | . . 3 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ V) | |
2 | fvssunirng 5527 | . . 3 ⊢ (𝐴 ∈ V → (𝐹‘𝐴) ⊆ ∪ ran 𝐹) | |
3 | 1, 2 | syl 14 | . 2 ⊢ (𝐴 ∈ 𝑊 → (𝐹‘𝐴) ⊆ ∪ ran 𝐹) |
4 | rnexg 4889 | . . 3 ⊢ (𝐹 ∈ 𝑉 → ran 𝐹 ∈ V) | |
5 | uniexg 4437 | . . 3 ⊢ (ran 𝐹 ∈ V → ∪ ran 𝐹 ∈ V) | |
6 | 4, 5 | syl 14 | . 2 ⊢ (𝐹 ∈ 𝑉 → ∪ ran 𝐹 ∈ V) |
7 | ssexg 4140 | . 2 ⊢ (((𝐹‘𝐴) ⊆ ∪ ran 𝐹 ∧ ∪ ran 𝐹 ∈ V) → (𝐹‘𝐴) ∈ V) | |
8 | 3, 6, 7 | syl2anr 290 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊) → (𝐹‘𝐴) ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2148 Vcvv 2737 ⊆ wss 3129 ∪ cuni 3808 ran crn 4625 ‘cfv 5213 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4119 ax-pow 4172 ax-pr 4207 ax-un 4431 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-v 2739 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3809 df-br 4002 df-opab 4063 df-cnv 4632 df-dm 4634 df-rn 4635 df-iota 5175 df-fv 5221 |
This theorem is referenced by: fvex 5532 ovexg 5904 rdgivallem 6377 frecabex 6394 mapsnconst 6689 cc2lem 7260 addvalex 7838 uzennn 10429 absval 11001 climmpt 11299 strnfvnd 12472 grpsubval 12847 mulgval 12914 mulgfng 12915 iscnp4 13500 cnpnei 13501 |
Copyright terms: Public domain | W3C validator |