Theorem mpoxopn0yelv 8192

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 8045	. . . 4 ⊢ dom 𝐹 ⊆ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥))
3		elfvdm 6895	. . . . 5 ⊢ (𝑁 ∈ (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
4		df-ov 7390	. . . . 5 ⊢ (⟨𝑉, 𝑊⟩𝐹𝐾) = (𝐹‘⟨⟨𝑉, 𝑊⟩, 𝐾⟩)
5	3, 4	eleq2s 2846	. . . 4 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ dom 𝐹)
6	2, 5	sselid 3944	. . 3 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → ⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)))
7		fveq2 6858	. . . . 5 ⊢ (𝑥 = ⟨𝑉, 𝑊⟩ → (1st ‘𝑥) = (1st ‘⟨𝑉, 𝑊⟩))
8	7	opeliunxp2 5802	. . . 4 ⊢ (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) ↔ (⟨𝑉, 𝑊⟩ ∈ V ∧ 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩)))
9	8	simprbi 496	. . 3 ⊢ (⟨⟨𝑉, 𝑊⟩, 𝐾⟩ ∈ ∪ 𝑥 ∈ V ({𝑥} × (1st ‘𝑥)) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
10	6, 9	syl 17	. 2 ⊢ (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩))
11		op1stg 7980	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (1st ‘⟨𝑉, 𝑊⟩) = 𝑉)
12	11	eleq2d 2814	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐾 ∈ (1st ‘⟨𝑉, 𝑊⟩) ↔ 𝐾 ∈ 𝑉))
13	10, 12	imbitrid 244	1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ 𝑉))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  Vcvv 3447  {csn 4589  ⟨cop 4595  ∪ ciun 4955   × cxp 5636  dom cdm 5638  ‘cfv 6511  (class class class)co 7387   ∈ cmpo 7389  1^st c1st 7966

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 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711

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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969

This theorem is referenced by:  mpoxopynvov0g  8193  mpoxopovel  8199