| 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 8092 that holds without ax-rep 5232. 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 2761 | . . 3 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) | |
| 2 | 1 | mpofun 7544 | . 2 ⊢ Fun (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
| 3 | mpoexw.4 | . . . 4 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 | |
| 4 | 1 | dmmpoga 8086 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝐴 × 𝐵)) |
| 5 | 3, 4 | ax-mp 5 | . . 3 ⊢ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝐴 × 𝐵) |
| 6 | mpoexw.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 7 | mpoexw.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 8 | 6, 7 | xpex 7767 | . . 3 ⊢ (𝐴 × 𝐵) ∈ V |
| 9 | 5, 8 | eqeltri 2857 | . 2 ⊢ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| 10 | 1 | rnmpo 7553 | . . 3 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} |
| 11 | mpoexw.3 | . . . 4 ⊢ 𝐷 ∈ V | |
| 12 | 3 | rspec 3254 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷) |
| 13 | 12 | r19.21bi 3255 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝐷) |
| 14 | eleq1a 2856 | . . . . . . . 8 ⊢ (𝐶 ∈ 𝐷 → (𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) | |
| 15 | 13, 14 | syl 18 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
| 16 | 15 | rexlimdva 3164 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
| 17 | 16 | rexlimiv 3157 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷) |
| 18 | 17 | abssi 4016 | . . . 4 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ⊆ 𝐷 |
| 19 | 11, 18 | ssexi 5284 | . . 3 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V |
| 20 | 10, 19 | eqeltri 2857 | . 2 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| 21 | funexw 7964 | . 2 ⊢ ((Fun (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∧ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V ∧ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) | |
| 22 | 2, 9, 20, 21 | mp3an 1490 | 1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {cab 2739 ∀wral 3077 ∃wrex 3087 Vcvv 3451 × cxp 5649 dom cdm 5651 ran crn 5652 Fun wfun 6532 ∈ cmpo 7422 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 |
| This theorem is used by: mptmpoopabbrd 8094 prdsvallem 17625 prdsds 17635 plusffval 18822 grpsubfval 19194 mulgfval 19279 scaffval 21155 ipffval 21954 |
| Copyright terms: Public domain | W3C validator |