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

Theorem mpoxopn0yelv 6470
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 6395 . . . 4 dom 𝐹 𝑥 ∈ V ({𝑥} × (1st𝑥))
31mpofun 6155 . . . . . . 7 Fun 𝐹
4 funrel 5369 . . . . . . 7 (Fun 𝐹 → Rel 𝐹)
53, 4ax-mp 5 . . . . . 6 Rel 𝐹
6 relelfvdm 5702 . . . . . 6 ((Rel 𝐹𝑁 ∈ (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩)) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
75, 6mpan 424 . . . . 5 (𝑁 ∈ (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
8 df-ov 6053 . . . . 5 (⟨𝑉, 𝑊𝐹𝐾) = (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩)
97, 8eleq2s 2327 . . . 4 (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
102, 9sselid 3236 . . 3 (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ 𝑥 ∈ V ({𝑥} × (1st𝑥)))
11 fveq2 5670 . . . . 5 (𝑥 = ⟨𝑉, 𝑊⟩ → (1st𝑥) = (1st ‘⟨𝑉, 𝑊⟩))
1211opeliunxp2 4895 . . . 4 (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ 𝑥 ∈ V ({𝑥} × (1st𝑥)) ↔ (⟨𝑉, 𝑊⟩ ∈ V ∧ 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩)))
1312simprbi 275 . . 3 (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ 𝑥 ∈ V ({𝑥} × (1st𝑥)) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
1410, 13syl 14 . 2 (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
15 op1stg 6344 . . 3 ((𝑉𝑋𝑊𝑌) → (1st ‘⟨𝑉, 𝑊⟩) = 𝑉)
1615eleq2d 2302 . 2 ((𝑉𝑋𝑊𝑌) → (𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩) ↔ 𝐾𝑉))
1714, 16imbitrid 154 1 ((𝑉𝑋𝑊𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊𝐹𝐾) → 𝐾𝑉))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203  Vcvv 2813  {csn 3689  cop 3692   ciun 3991   × cxp 4747  dom cdm 4749  Rel wrel 4754  Fun wfun 5346  cfv 5352  (class class class)co 6050  cmpo 6052  1st c1st 6332
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335
This theorem is referenced by:  mpoxopovel  6472
  Copyright terms: Public domain W3C validator