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

Theorem mpoxopn0yelv 8163
Description: If there is an element of the value of an operation given by a maps-to rule, where the first argument is a pair and the base set of the second argument is the first component of the first argument, then the second argument is an element of the first component of the first argument. (Contributed by Alexander van der Vekens, 10-Oct-2017.)
Hypothesis
Ref Expression
mpoxopn0yelv.f 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st𝑥) ↦ 𝐶)
Assertion
Ref Expression
mpoxopn0yelv ((𝑉𝑋𝑊𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → 𝐾𝑉))
Distinct variable groups:   𝑥,𝑦   𝑥,𝐾   𝑥,𝑉   𝑥,𝑊
Allowed substitution hints:   𝐶(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝐾(𝑦)   𝑁(𝑥,𝑦)   𝑉(𝑦)   𝑊(𝑦)   𝑋(𝑥,𝑦)   𝑌(𝑥,𝑦)

Proof of Theorem mpoxopn0yelv
StepHypRef Expression
1 mpoxopn0yelv.f . . . . 5 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st𝑥) ↦ 𝐶)
21dmmpossx 8019 . . . 4 dom 𝐹 𝑥 ∈ V ({𝑥} × (1st𝑥))
3 elfvdm 6874 . . . . 5 (𝑁 ∈ (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
4 df-ov 7370 . . . . 5 (⟨𝑉, 𝑊𝐹𝐾) = (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩)
53, 4eleq2s 2854 . . . 4 (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
62, 5sselid 3919 . . 3 (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ 𝑥 ∈ V ({𝑥} × (1st𝑥)))
7 fveq2 6840 . . . . 5 (𝑥 = ⟨𝑉, 𝑊⟩ → (1st𝑥) = (1st ‘⟨𝑉, 𝑊⟩))
87opeliunxp2 5793 . . . 4 (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ 𝑥 ∈ V ({𝑥} × (1st𝑥)) ↔ (⟨𝑉, 𝑊⟩ ∈ V ∧ 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩)))
98simprbi 497 . . 3 (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ 𝑥 ∈ V ({𝑥} × (1st𝑥)) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
106, 9syl 17 . 2 (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
11 op1stg 7954 . . 3 ((𝑉𝑋𝑊𝑌) → (1st ‘⟨𝑉, 𝑊⟩) = 𝑉)
1211eleq2d 2822 . 2 ((𝑉𝑋𝑊𝑌) → (𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩) ↔ 𝐾𝑉))
1310, 12imbitrid 244 1 ((𝑉𝑋𝑊𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → 𝐾𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3429  {csn 4567  cop 4573   ciun 4933   × cxp 5629  dom cdm 5631  cfv 6498  (class class class)co 7367  cmpo 7369  1st c1st 7940
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943
This theorem is referenced by:  mpoxopynvov0g  8164  mpoxopovel  8170
  Copyright terms: Public domain W3C validator