| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > abrexexd | Structured version Visualization version GIF version | ||
| Description: Existence of a class abstraction of existentially restricted sets. (Contributed by Thierry Arnoux, 10-May-2017.) |
| Ref | Expression |
|---|---|
| abrexexd.0 | ⊢ Ⅎ𝑥𝐴 |
| abrexexd.1 | ⊢ (𝜑 → 𝐴 ∈ V) |
| Ref | Expression |
|---|---|
| abrexexd | ⊢ (𝜑 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnopab 5946 | . . 3 ⊢ ran {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} | |
| 2 | df-mpt 5194 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} | |
| 3 | 2 | rneqi 5929 | . . 3 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ran {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} |
| 4 | df-rex 3090 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)) | |
| 5 | 4 | abbii 2830 | . . 3 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} |
| 6 | 1, 3, 5 | 3eqtr4i 2796 | . 2 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| 7 | abrexexd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ V) | |
| 8 | funmpt 6576 | . . . 4 ⊢ Fun (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 9 | eqid 2763 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 10 | 9 | dmmpt 6243 | . . . . 5 ⊢ dom (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V} |
| 11 | abrexexd.0 | . . . . . 6 ⊢ Ⅎ𝑥𝐴 | |
| 12 | 11 | rabexgfGS 32826 | . . . . 5 ⊢ (𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V} ∈ V) |
| 13 | 10, 12 | eqeltrid 2867 | . . . 4 ⊢ (𝐴 ∈ V → dom (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) |
| 14 | funex 7219 | . . . 4 ⊢ ((Fun (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ dom (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
| 15 | 8, 13, 14 | sylancr 598 | . . 3 ⊢ (𝐴 ∈ V → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) |
| 16 | rnexg 7900 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
| 17 | 7, 15, 16 | 3syl 19 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) |
| 18 | 6, 17 | eqeltrrid 2868 | 1 ⊢ (𝜑 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∃wex 1809 ∈ wcel 2143 {cab 2741 Ⅎwnfc 2910 ∃wrex 3089 {crab 3416 Vcvv 3455 {copab 5174 ↦ cmpt 5193 dom cdm 5663 ran crn 5664 Fun wfun 6532 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 |
| This theorem is referenced by: esumc 34422 |
| Copyright terms: Public domain | W3C validator |