![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > mpoexw | GIF version |
Description: Weak version of mpoex 6267 that holds without ax-coll 4144. 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 2193 | . . 3 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) | |
2 | 1 | mpofun 6020 | . 2 ⊢ Fun (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
3 | mpoexw.4 | . . . 4 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 | |
4 | 1 | dmmpoga 6261 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝐴 × 𝐵)) |
5 | 3, 4 | ax-mp 5 | . . 3 ⊢ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝐴 × 𝐵) |
6 | mpoexw.1 | . . . 4 ⊢ 𝐴 ∈ V | |
7 | mpoexw.2 | . . . 4 ⊢ 𝐵 ∈ V | |
8 | 6, 7 | xpex 4774 | . . 3 ⊢ (𝐴 × 𝐵) ∈ V |
9 | 5, 8 | eqeltri 2266 | . 2 ⊢ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
10 | 1 | rnmpo 6029 | . . 3 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} |
11 | mpoexw.3 | . . . 4 ⊢ 𝐷 ∈ V | |
12 | 3 | rspec 2546 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷) |
13 | 12 | r19.21bi 2582 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝐷) |
14 | eleq1a 2265 | . . . . . . . 8 ⊢ (𝐶 ∈ 𝐷 → (𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) | |
15 | 13, 14 | syl 14 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
16 | 15 | rexlimdva 2611 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
17 | 16 | rexlimiv 2605 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷) |
18 | 17 | abssi 3254 | . . . 4 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ⊆ 𝐷 |
19 | 11, 18 | ssexi 4167 | . . 3 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V |
20 | 10, 19 | eqeltri 2266 | . 2 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
21 | funexw 6164 | . 2 ⊢ ((Fun (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∧ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V ∧ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) | |
22 | 2, 9, 20, 21 | mp3an 1348 | 1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 {cab 2179 ∀wral 2472 ∃wrex 2473 Vcvv 2760 × cxp 4657 dom cdm 4659 ran crn 4660 Fun wfun 5248 ∈ cmpo 5920 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-fv 5262 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |