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

Theorem mpoexw 6377
Description: Weak version of mpoex 6378 that holds without ax-coll 4204. 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 2231 . . 3 (𝑥𝐴, 𝑦𝐵𝐶) = (𝑥𝐴, 𝑦𝐵𝐶)
21mpofun 6122 . 2 Fun (𝑥𝐴, 𝑦𝐵𝐶)
3 mpoexw.4 . . . 4 𝑥𝐴𝑦𝐵 𝐶𝐷
41dmmpoga 6372 . . . 4 (∀𝑥𝐴𝑦𝐵 𝐶𝐷 → dom (𝑥𝐴, 𝑦𝐵𝐶) = (𝐴 × 𝐵))
53, 4ax-mp 5 . . 3 dom (𝑥𝐴, 𝑦𝐵𝐶) = (𝐴 × 𝐵)
6 mpoexw.1 . . . 4 𝐴 ∈ V
7 mpoexw.2 . . . 4 𝐵 ∈ V
86, 7xpex 4842 . . 3 (𝐴 × 𝐵) ∈ V
95, 8eqeltri 2304 . 2 dom (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
101rnmpo 6131 . . 3 ran (𝑥𝐴, 𝑦𝐵𝐶) = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶}
11 mpoexw.3 . . . 4 𝐷 ∈ V
123rspec 2584 . . . . . . . . 9 (𝑥𝐴 → ∀𝑦𝐵 𝐶𝐷)
1312r19.21bi 2620 . . . . . . . 8 ((𝑥𝐴𝑦𝐵) → 𝐶𝐷)
14 eleq1a 2303 . . . . . . . 8 (𝐶𝐷 → (𝑧 = 𝐶𝑧𝐷))
1513, 14syl 14 . . . . . . 7 ((𝑥𝐴𝑦𝐵) → (𝑧 = 𝐶𝑧𝐷))
1615rexlimdva 2650 . . . . . 6 (𝑥𝐴 → (∃𝑦𝐵 𝑧 = 𝐶𝑧𝐷))
1716rexlimiv 2644 . . . . 5 (∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶𝑧𝐷)
1817abssi 3302 . . . 4 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶} ⊆ 𝐷
1911, 18ssexi 4227 . . 3 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶} ∈ V
2010, 19eqeltri 2304 . 2 ran (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
21 funexw 6273 . 2 ((Fun (𝑥𝐴, 𝑦𝐵𝐶) ∧ dom (𝑥𝐴, 𝑦𝐵𝐶) ∈ V ∧ ran (𝑥𝐴, 𝑦𝐵𝐶) ∈ V) → (𝑥𝐴, 𝑦𝐵𝐶) ∈ V)
222, 9, 20, 21mp3an 1373 1 (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2202  {cab 2217  wral 2510  wrex 2511  Vcvv 2802   × cxp 4723  dom cdm 4725  ran crn 4726  Fun wfun 5320  cmpo 6019
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303
This theorem is referenced by:  prdsvallem  13354
  Copyright terms: Public domain W3C validator