| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mpoexw | GIF version | ||
| Description: Weak version of mpoex 6299 that holds without ax-coll 4158. 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 2204 | . . 3 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) | |
| 2 | 1 | mpofun 6046 | . 2 ⊢ Fun (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
| 3 | mpoexw.4 | . . . 4 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 | |
| 4 | 1 | dmmpoga 6293 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝐴 × 𝐵)) |
| 5 | 3, 4 | ax-mp 5 | . . 3 ⊢ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝐴 × 𝐵) |
| 6 | mpoexw.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 7 | mpoexw.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 8 | 6, 7 | xpex 4789 | . . 3 ⊢ (𝐴 × 𝐵) ∈ V |
| 9 | 5, 8 | eqeltri 2277 | . 2 ⊢ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| 10 | 1 | rnmpo 6055 | . . 3 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} |
| 11 | mpoexw.3 | . . . 4 ⊢ 𝐷 ∈ V | |
| 12 | 3 | rspec 2557 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷) |
| 13 | 12 | r19.21bi 2593 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝐷) |
| 14 | eleq1a 2276 | . . . . . . . 8 ⊢ (𝐶 ∈ 𝐷 → (𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) | |
| 15 | 13, 14 | syl 14 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
| 16 | 15 | rexlimdva 2622 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷)) |
| 17 | 16 | rexlimiv 2616 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷) |
| 18 | 17 | abssi 3267 | . . . 4 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ⊆ 𝐷 |
| 19 | 11, 18 | ssexi 4181 | . . 3 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶} ∈ V |
| 20 | 10, 19 | eqeltri 2277 | . 2 ⊢ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| 21 | funexw 6196 | . 2 ⊢ ((Fun (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∧ dom (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V ∧ ran (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) | |
| 22 | 2, 9, 20, 21 | mp3an 1349 | 1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1372 ∈ wcel 2175 {cab 2190 ∀wral 2483 ∃wrex 2484 Vcvv 2771 × cxp 4672 dom cdm 4674 ran crn 4675 Fun wfun 5264 ∈ cmpo 5945 |
| 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 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ral 2488 df-rex 2489 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-id 4339 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-rn 4685 df-res 4686 df-ima 4687 df-iota 5231 df-fun 5272 df-fn 5273 df-f 5274 df-fv 5278 df-oprab 5947 df-mpo 5948 df-1st 6225 df-2nd 6226 |
| This theorem is referenced by: prdsvallem 13046 |
| Copyright terms: Public domain | W3C validator |