MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mpoexw Structured version   Visualization version   GIF version

Theorem mpoexw 8062
Description: Weak version of mpoex 8063 that holds without ax-rep 5285. 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.)
Hypotheses
Ref Expression
mpoexw.1 𝐴 ∈ V
mpoexw.2 𝐵 ∈ V
mpoexw.3 𝐷 ∈ V
mpoexw.4 𝑥𝐴𝑦𝐵 𝐶𝐷
Assertion
Ref Expression
mpoexw (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐷,𝑦
Allowed substitution hints:   𝐶(𝑥,𝑦)

Proof of Theorem mpoexw
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqid 2733 . . 3 (𝑥𝐴, 𝑦𝐵𝐶) = (𝑥𝐴, 𝑦𝐵𝐶)
21mpofun 7529 . 2 Fun (𝑥𝐴, 𝑦𝐵𝐶)
3 mpoexw.4 . . . 4 𝑥𝐴𝑦𝐵 𝐶𝐷
41dmmpoga 8056 . . . 4 (∀𝑥𝐴𝑦𝐵 𝐶𝐷 → dom (𝑥𝐴, 𝑦𝐵𝐶) = (𝐴 × 𝐵))
53, 4ax-mp 5 . . 3 dom (𝑥𝐴, 𝑦𝐵𝐶) = (𝐴 × 𝐵)
6 mpoexw.1 . . . 4 𝐴 ∈ V
7 mpoexw.2 . . . 4 𝐵 ∈ V
86, 7xpex 7737 . . 3 (𝐴 × 𝐵) ∈ V
95, 8eqeltri 2830 . 2 dom (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
101rnmpo 7539 . . 3 ran (𝑥𝐴, 𝑦𝐵𝐶) = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶}
11 mpoexw.3 . . . 4 𝐷 ∈ V
123rspec 3248 . . . . . . . . 9 (𝑥𝐴 → ∀𝑦𝐵 𝐶𝐷)
1312r19.21bi 3249 . . . . . . . 8 ((𝑥𝐴𝑦𝐵) → 𝐶𝐷)
14 eleq1a 2829 . . . . . . . 8 (𝐶𝐷 → (𝑧 = 𝐶𝑧𝐷))
1513, 14syl 17 . . . . . . 7 ((𝑥𝐴𝑦𝐵) → (𝑧 = 𝐶𝑧𝐷))
1615rexlimdva 3156 . . . . . 6 (𝑥𝐴 → (∃𝑦𝐵 𝑧 = 𝐶𝑧𝐷))
1716rexlimiv 3149 . . . . 5 (∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶𝑧𝐷)
1817abssi 4067 . . . 4 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶} ⊆ 𝐷
1911, 18ssexi 5322 . . 3 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶} ∈ V
2010, 19eqeltri 2830 . 2 ran (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
21 funexw 7935 . 2 ((Fun (𝑥𝐴, 𝑦𝐵𝐶) ∧ dom (𝑥𝐴, 𝑦𝐵𝐶) ∈ V ∧ ran (𝑥𝐴, 𝑦𝐵𝐶) ∈ V) → (𝑥𝐴, 𝑦𝐵𝐶) ∈ V)
222, 9, 20, 21mp3an 1462 1 (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1542  wcel 2107  {cab 2710  wral 3062  wrex 3071  Vcvv 3475   × cxp 5674  dom cdm 5676  ran crn 5677  Fun wfun 6535  cmpo 7408
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7722
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6493  df-fun 6543  df-fn 6544  df-f 6545  df-fv 6549  df-oprab 7410  df-mpo 7411  df-1st 7972  df-2nd 7973
This theorem is referenced by:  prdsvallem  17397  prdsds  17407  plusffval  18564  grpsubfval  18865  mulgfval  18947  scaffval  20483  ipffval  21193
  Copyright terms: Public domain W3C validator