| 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 5903 | . . 3 ⊢ ran {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} | |
| 2 | df-mpt 5180 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} | |
| 3 | 2 | rneqi 5886 | . . 3 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ran {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} |
| 4 | df-rex 3061 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)) | |
| 5 | 4 | abbii 2803 | . . 3 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} |
| 6 | 1, 3, 5 | 3eqtr4i 2769 | . 2 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| 7 | abrexexd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ V) | |
| 8 | funmpt 6530 | . . . 4 ⊢ Fun (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 9 | eqid 2736 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 10 | 9 | dmmpt 6198 | . . . . 5 ⊢ dom (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V} |
| 11 | abrexexd.0 | . . . . . 6 ⊢ Ⅎ𝑥𝐴 | |
| 12 | 11 | rabexgfGS 32574 | . . . . 5 ⊢ (𝐴 ∈ V → {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V} ∈ V) |
| 13 | 10, 12 | eqeltrid 2840 | . . . 4 ⊢ (𝐴 ∈ V → dom (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) |
| 14 | funex 7165 | . . . 4 ⊢ ((Fun (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ dom (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
| 15 | 8, 13, 14 | sylancr 587 | . . 3 ⊢ (𝐴 ∈ V → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) |
| 16 | rnexg 7844 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
| 17 | 7, 15, 16 | 3syl 18 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) |
| 18 | 6, 17 | eqeltrrid 2841 | 1 ⊢ (𝜑 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2113 {cab 2714 Ⅎwnfc 2883 ∃wrex 3060 {crab 3399 Vcvv 3440 {copab 5160 ↦ cmpt 5179 dom cdm 5624 ran crn 5625 Fun wfun 6486 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 |
| This theorem is referenced by: esumc 34208 |
| Copyright terms: Public domain | W3C validator |