Theorem mpoxopn0yelv 8195

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 8048	. . . 4 ⊢ dom 𝐹 ⊆ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥))
3		elfvdm 6898	. . . . 5 ⊢ (𝑁 ∈ (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
4		df-ov 7393	. . . . 5 ⊢ (⟨𝑉, 𝑊⟩𝐹𝐾) = (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩)
5	3, 4	eleq2s 2847	. . . 4 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
6	2, 5	sselid 3947	. . 3 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)))
7		fveq2 6861	. . . . 5 ⊢ (𝑥 = ⟨𝑉, 𝑊⟩ → (1st ‘𝑥) = (1st ‘⟨𝑉, 𝑊⟩))
8	7	opeliunxp2 5805	. . . 4 ⊢ (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) ↔ (⟨𝑉, 𝑊⟩ ∈ V ∧ 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩)))
9	8	simprbi 496	. . 3 ⊢ (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
10	6, 9	syl 17	. 2 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
11		op1stg 7983	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (1st ‘⟨𝑉, 𝑊⟩) = 𝑉)
12	11	eleq2d 2815	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩) ↔ 𝐾 ∈ 𝑉))
13	10, 12	imbitrid 244	1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ 𝑉))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  Vcvv 3450  {csn 4592  ⟨cop 4598  ∪ ciun 4958   × cxp 5639  dom cdm 5641  ‘cfv 6514  (class class class)co 7390   ∈ cmpo 7392  1^st c1st 7969

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972

This theorem is referenced by:  mpoxopynvov0g  8196  mpoxopovel  8202