| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mpoexw | Structured version Visualization version GIF version | ||
| Description: Weak version of mpoex 8083 that holds without ax-rep 5254. If the domain and codomain of an operation given by maps-to notation are sets, the operation is a set. (Contributed by Rohan Ridenour, 14-Aug-2023.) |
| Ref | Expression |
|---|---|
| mpoexw.1 | ⊢ 𝐴 ∈ V |
| mpoexw.2 | ⊢ 𝐵 ∈ V |
| mpoexw.3 | ⊢ 𝐷 ∈ V |
| mpoexw.4 | ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 |
| Ref | Expression |
|---|---|
| mpoexw | ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2736 | . . 3 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) | |
| 2 | 1 | mpofun 7536 | . 2 ⊢ Fun (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
| 3 | mpoexw.4 | . . . 4 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 | |
| 4 | 1 | dmmpoga 8077 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝐴 × 𝐵)) |
| 5 | 3, 4 | ax-mp 5 | . . 3 ⊢ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝐴 × 𝐵) |
| 6 | mpoexw.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 7 | mpoexw.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 8 | 6, 7 | xpex 7752 | . . 3 ⊢ (𝐴 × 𝐵) ∈ V |
| 9 | 5, 8 | eqeltri 2831 | . 2 ⊢ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| 10 | 1 | rnmpo 7545 | . . 3 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} |
| 11 | mpoexw.3 | . . . 4 ⊢ 𝐷 ∈ V | |
| 12 | 3 | rspec 3237 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷) |
| 13 | 12 | r19.21bi 3238 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝐷) |
| 14 | eleq1a 2830 | . . . . . . . 8 ⊢ (𝐶 ∈ 𝐷 → (𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) | |
| 15 | 13, 14 | syl 17 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
| 16 | 15 | rexlimdva 3142 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
| 17 | 16 | rexlimiv 3135 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷) |
| 18 | 17 | abssi 4050 | . . . 4 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ⊆ 𝐷 |
| 19 | 11, 18 | ssexi 5297 | . . 3 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V |
| 20 | 10, 19 | eqeltri 2831 | . 2 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| 21 | funexw 7955 | . 2 ⊢ ((Fun (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∧ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V ∧ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) | |
| 22 | 2, 9, 20, 21 | mp3an 1463 | 1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {cab 2714 ∀wral 3052 ∃wrex 3061 Vcvv 3464 × cxp 5657 dom cdm 5659 ran crn 5660 Fun wfun 6530 ∈ cmpo 7412 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-fv 6544 df-oprab 7414 df-mpo 7415 df-1st 7993 df-2nd 7994 |
| This theorem is referenced by: mptmpoopabbrd 8084 prdsvallem 17473 prdsds 17483 plusffval 18629 grpsubfval 18971 mulgfval 19057 scaffval 20842 ipffval 21613 |
| Copyright terms: Public domain | W3C validator |