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

Theorem mpoexw 6271
Description: Weak version of mpoex 6272 that holds without ax-coll 4148. 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 2196 . . 3 (𝑥𝐴, 𝑦𝐵𝐶) = (𝑥𝐴, 𝑦𝐵𝐶)
21mpofun 6024 . 2 Fun (𝑥𝐴, 𝑦𝐵𝐶)
3 mpoexw.4 . . . 4 𝑥𝐴𝑦𝐵 𝐶𝐷
41dmmpoga 6266 . . . 4 (∀𝑥𝐴𝑦𝐵 𝐶𝐷 → dom (𝑥𝐴, 𝑦𝐵𝐶) = (𝐴 × 𝐵))
53, 4ax-mp 5 . . 3 dom (𝑥𝐴, 𝑦𝐵𝐶) = (𝐴 × 𝐵)
6 mpoexw.1 . . . 4 𝐴 ∈ V
7 mpoexw.2 . . . 4 𝐵 ∈ V
86, 7xpex 4778 . . 3 (𝐴 × 𝐵) ∈ V
95, 8eqeltri 2269 . 2 dom (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
101rnmpo 6033 . . 3 ran (𝑥𝐴, 𝑦𝐵𝐶) = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶}
11 mpoexw.3 . . . 4 𝐷 ∈ V
123rspec 2549 . . . . . . . . 9 (𝑥𝐴 → ∀𝑦𝐵 𝐶𝐷)
1312r19.21bi 2585 . . . . . . . 8 ((𝑥𝐴𝑦𝐵) → 𝐶𝐷)
14 eleq1a 2268 . . . . . . . 8 (𝐶𝐷 → (𝑧 = 𝐶𝑧𝐷))
1513, 14syl 14 . . . . . . 7 ((𝑥𝐴𝑦𝐵) → (𝑧 = 𝐶𝑧𝐷))
1615rexlimdva 2614 . . . . . 6 (𝑥𝐴 → (∃𝑦𝐵 𝑧 = 𝐶𝑧𝐷))
1716rexlimiv 2608 . . . . 5 (∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶𝑧𝐷)
1817abssi 3258 . . . 4 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶} ⊆ 𝐷
1911, 18ssexi 4171 . . 3 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶} ∈ V
2010, 19eqeltri 2269 . 2 ran (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
21 funexw 6169 . 2 ((Fun (𝑥𝐴, 𝑦𝐵𝐶) ∧ dom (𝑥𝐴, 𝑦𝐵𝐶) ∈ V ∧ ran (𝑥𝐴, 𝑦𝐵𝐶) ∈ V) → (𝑥𝐴, 𝑦𝐵𝐶) ∈ V)
222, 9, 20, 21mp3an 1348 1 (𝑥𝐴, 𝑦𝐵𝐶) ∈ V
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1364  wcel 2167  {cab 2182  wral 2475  wrex 2476  Vcvv 2763   × cxp 4661  dom cdm 4663  ran crn 4664  Fun wfun 5252  cmpo 5924
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-fv 5266  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator