ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mpoexw GIF version

Theorem mpoexw 6439
Description: Weak version of mpoex 6440 that holds without ax-coll 4241. 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 2238 . . 3 (𝑥𝐴, 𝑦𝐵𝐶) = (𝑥𝐴, 𝑦𝐵𝐶)
21mpofun 6180 . 2 Fun (𝑥𝐴, 𝑦𝐵𝐶)
3 mpoexw.4 . . . 4 𝑥𝐴𝑦𝐵 𝐶𝐷
41dmmpoga 6434 . . . 4 (∀𝑥𝐴𝑦𝐵 𝐶𝐷 → dom (𝑥𝐴, 𝑦𝐵𝐶) = (𝐴 × 𝐵))
53, 4ax-mp 5 . . 3 dom (𝑥𝐴, 𝑦𝐵𝐶) = (𝐴 × 𝐵)
6 mpoexw.1 . . . 4 𝐴 ∈ V
7 mpoexw.2 . . . 4 𝐵 ∈ V
86, 7xpex 4886 . . 3 (𝐴 × 𝐵) ∈ V
95, 8eqeltri 2311 . 2 dom (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
101rnmpo 6189 . . 3 ran (𝑥𝐴, 𝑦𝐵𝐶) = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶}
11 mpoexw.3 . . . 4 𝐷 ∈ V
123rspec 2602 . . . . . . . . 9 (𝑥𝐴 → ∀𝑦𝐵 𝐶𝐷)
1312r19.21bi 2638 . . . . . . . 8 ((𝑥𝐴𝑦𝐵) → 𝐶𝐷)
14 eleq1a 2310 . . . . . . . 8 (𝐶𝐷 → (𝑧 = 𝐶𝑧𝐷))
1513, 14syl 14 . . . . . . 7 ((𝑥𝐴𝑦𝐵) → (𝑧 = 𝐶𝑧𝐷))
1615rexlimdva 2668 . . . . . 6 (𝑥𝐴 → (∃𝑦𝐵 𝑧 = 𝐶𝑧𝐷))
1716rexlimiv 2662 . . . . 5 (∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶𝑧𝐷)
1817abssi 3323 . . . 4 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶} ⊆ 𝐷
1911, 18ssexi 4266 . . 3 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶} ∈ V
2010, 19eqeltri 2311 . 2 ran (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
21 funexw 6331 . 2 ((Fun (𝑥𝐴, 𝑦𝐵𝐶) ∧ dom (𝑥𝐴, 𝑦𝐵𝐶) ∈ V ∧ ran (𝑥𝐴, 𝑦𝐵𝐶) ∈ V) → (𝑥𝐴, 𝑦𝐵𝐶) ∈ V)
222, 9, 20, 21mp3an 1378 1 (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1402  wcel 2209  {cab 2224  wral 2528  wrex 2529  Vcvv 2821   × cxp 4767  dom cdm 4769  ran crn 4770  Fun wfun 5366  cmpo 6077
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365
This theorem is referenced by:  prdsvallem  13598
  Copyright terms: Public domain W3C validator