Theorem mpoxopn0yelv 8230

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

Step	Hyp	Ref	Expression
1		mpoxopn0yelv.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ 𝐶)
2	1	dmmpossx 8077	. . . 4 ⊢ dom 𝐹 ⊆ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥))
3		elfvdm 6919	. . . . 5 ⊢ (𝑁 ∈ (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
4		df-ov 7423	. . . . 5 ⊢ (⟨𝑉, 𝑊⟩𝐹𝐾) = (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩)
5	3, 4	eleq2s 2879	. . . 4 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
6	2, 5	sselid 3929	. . 3 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)))
7		fveq2 6885	. . . . 5 ⊢ (𝑥 = ⟨𝑉, 𝑊⟩ → (1st ‘𝑥) = (1st ‘⟨𝑉, 𝑊⟩))
8	7	opeliunxp2 5815	. . . 4 ⊢ (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) ↔ (⟨𝑉, 𝑊⟩ ∈ V ∧ 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩)))
9	8	simprbi 503	. . 3 ⊢ (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
10	6, 9	syl 18	. 2 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
11		op1stg 8013	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (1st ‘⟨𝑉, 𝑊⟩) = 𝑉)
12	11	eleq2d 2847	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩) ↔ 𝐾 ∈ 𝑉))
13	10, 12	imbitrid 247	1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ 𝑉))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {csn 4584  ⟨cop 4590  ∪ ciun 4951   × cxp 5649  dom cdm 5651  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  1^st c1st 7999

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002

This theorem is used by:  mpoxopynvov0g  8231  mpoxopovel  8237