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

Theorem mpofvex 6441
Description: Sufficient condition for an operation maps-to notation to be set-like. (Contributed by Mario Carneiro, 3-Jul-2019.)
Hypothesis
Ref Expression
mpofvex.1 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
Assertion
Ref Expression
mpofvex ((∀𝑥𝑦 𝐶𝑉𝑅𝑊𝑆𝑋) → (𝑅𝐹𝑆) ∈ V)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥, 𝑦)   𝑅(𝑥, 𝑦)   𝑆(𝑥, 𝑦)   𝐹(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)   𝑋(𝑥, 𝑦)

Proof of Theorem mpofvex
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-ov 6088 . 2 (𝑅𝐹𝑆) = (𝐹‘⟨𝑅, 𝑆⟩)
2 elex 2833 . . . . . . . . 9 (𝐶𝑉𝐶 ∈ V)
32alimi 1508 . . . . . . . 8 (∀𝑦 𝐶𝑉 → ∀𝑦 𝐶 ∈ V)
4 vex 2824 . . . . . . . . 9 𝑧 ∈ V
5 2ndexg 6402 . . . . . . . . 9 (𝑧 ∈ V → (2nd𝑧) ∈ V)
6 nfcv 2392 . . . . . . . . . 10 𝑦(2nd𝑧)
7 nfcsb1v 3180 . . . . . . . . . . 11 𝑦(2nd𝑧) / 𝑦𝐶
87nfel1 2403 . . . . . . . . . 10 𝑦(2nd𝑧) / 𝑦𝐶 ∈ V
9 csbeq1a 3156 . . . . . . . . . . 11 (𝑦 = (2nd𝑧) → 𝐶 = (2nd𝑧) / 𝑦𝐶)
109eleq1d 2307 . . . . . . . . . 10 (𝑦 = (2nd𝑧) → (𝐶 ∈ V ↔ (2nd𝑧) / 𝑦𝐶 ∈ V))
116, 8, 10spcgf 2907 . . . . . . . . 9 ((2nd𝑧) ∈ V → (∀𝑦 𝐶 ∈ V → (2nd𝑧) / 𝑦𝐶 ∈ V))
124, 5, 11mp2b 8 . . . . . . . 8 (∀𝑦 𝐶 ∈ V → (2nd𝑧) / 𝑦𝐶 ∈ V)
133, 12syl 14 . . . . . . 7 (∀𝑦 𝐶𝑉(2nd𝑧) / 𝑦𝐶 ∈ V)
1413alimi 1508 . . . . . 6 (∀𝑥𝑦 𝐶𝑉 → ∀𝑥(2nd𝑧) / 𝑦𝐶 ∈ V)
15 1stexg 6401 . . . . . . 7 (𝑧 ∈ V → (1st𝑧) ∈ V)
16 nfcv 2392 . . . . . . . 8 𝑥(1st𝑧)
17 nfcsb1v 3180 . . . . . . . . 9 𝑥(1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶
1817nfel1 2403 . . . . . . . 8 𝑥(1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶 ∈ V
19 csbeq1a 3156 . . . . . . . . 9 (𝑥 = (1st𝑧) → (2nd𝑧) / 𝑦𝐶 = (1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶)
2019eleq1d 2307 . . . . . . . 8 (𝑥 = (1st𝑧) → ((2nd𝑧) / 𝑦𝐶 ∈ V ↔ (1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶 ∈ V))
2116, 18, 20spcgf 2907 . . . . . . 7 ((1st𝑧) ∈ V → (∀𝑥(2nd𝑧) / 𝑦𝐶 ∈ V → (1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶 ∈ V))
224, 15, 21mp2b 8 . . . . . 6 (∀𝑥(2nd𝑧) / 𝑦𝐶 ∈ V → (1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶 ∈ V)
2314, 22syl 14 . . . . 5 (∀𝑥𝑦 𝐶𝑉(1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶 ∈ V)
2423alrimiv 1927 . . . 4 (∀𝑥𝑦 𝐶𝑉 → ∀𝑧(1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶 ∈ V)
25243ad2ant1 1049 . . 3 ((∀𝑥𝑦 𝐶𝑉𝑅𝑊𝑆𝑋) → ∀𝑧(1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶 ∈ V)
26 opexg 4368 . . . 4 ((𝑅𝑊𝑆𝑋) → ⟨𝑅, 𝑆⟩ ∈ V)
27263adant1 1046 . . 3 ((∀𝑥𝑦 𝐶𝑉𝑅𝑊𝑆𝑋) → ⟨𝑅, 𝑆⟩ ∈ V)
28 mpofvex.1 . . . . 5 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
29 mpomptsx 6433 . . . . 5 (𝑥𝐴, 𝑦𝐵𝐶) = (𝑧 𝑥𝐴 ({𝑥} × 𝐵) ↦ (1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶)
3028, 29eqtri 2259 . . . 4 𝐹 = (𝑧 𝑥𝐴 ({𝑥} × 𝐵) ↦ (1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶)
3130mptfvex 5791 . . 3 ((∀𝑧(1st𝑧) / 𝑥(2nd𝑧) / 𝑦𝐶 ∈ V ∧ ⟨𝑅, 𝑆⟩ ∈ V) → (𝐹‘⟨𝑅, 𝑆⟩) ∈ V)
3225, 27, 31syl2anc 415 . 2 ((∀𝑥𝑦 𝐶𝑉𝑅𝑊𝑆𝑋) → (𝐹‘⟨𝑅, 𝑆⟩) ∈ V)
331, 32eqeltrid 2325 1 ((∀𝑥𝑦 𝐶𝑉𝑅𝑊𝑆𝑋) → (𝑅𝐹𝑆) ∈ V)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  w3a 1009  wal 1400   = wceq 1402  wcel 2209  Vcvv 2821  csb 3147  {csn 3709  cop 3712   ciun 4012  cmpt 4192   × cxp 4772  cfv 5377  (class class class)co 6085  cmpo 6087  1st c1st 6372  2nd c2nd 6373
This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof 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-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fo 5383  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375
This theorem is used by:  mpofvexi  6442  oaexg  6721  omexg  6724  oeiexg  6726  rhmex  14466  clwwlknon  16682
  Copyright terms: Public domain W3C validator