Theorem mpoxopovel 8174

Description: 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. (Contributed by Alexander van der Vekens and Mario Carneiro, 10-Oct-2017.)

Hypothesis

Ref	Expression
mpoxopoveq.f	⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ {𝑛 ∈ (1st ‘𝑥) ∣ 𝜑})

Assertion

Ref	Expression
mpoxopovel	⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ (𝐾 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))

Distinct variable groups:   𝑛,𝐾,𝑥,𝑦   𝑛,𝑉,𝑥,𝑦   𝑛,𝑊,𝑥,𝑦   𝑛,𝑋,𝑥,𝑦   𝑛,𝑌,𝑥,𝑦   𝑥,𝑁,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑛)   𝐹(𝑥,𝑦,𝑛)   𝑁(𝑛)

Proof of Theorem mpoxopovel

Step	Hyp	Ref	Expression
1		mpoxopoveq.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ V, 𝑦 ∈ (1st ‘𝑥) ↦ {𝑛 ∈ (1st ‘𝑥) ∣ 𝜑})
2	1	mpoxopn0yelv 8167	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ 𝑉))
3	2	pm4.71rd 562	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ (𝐾 ∈ 𝑉 ∧ 𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾))))
4	1	mpoxopoveq 8173	. . . . . 6 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
5	4	eleq2d 2823	. . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ 𝑁 ∈ {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
6		nfcv 2899	. . . . . . 7 ⊢ Ⅎ𝑛𝑉
7	6	elrabsf 3788	. . . . . 6 ⊢ (𝑁 ∈ {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} ↔ (𝑁 ∈ 𝑉 ∧ [𝑁 / 𝑛][⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑))
8		sbccom 3823	. . . . . . . 8 ⊢ ([𝑁 / 𝑛][⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑 ↔ [⟨𝑉, 𝑊⟩ / 𝑥][𝑁 / 𝑛][𝐾 / 𝑦]𝜑)
9		sbccom 3823	. . . . . . . . 9 ⊢ ([𝑁 / 𝑛][𝐾 / 𝑦]𝜑 ↔ [𝐾 / 𝑦][𝑁 / 𝑛]𝜑)
10	9	sbcbii 3799	. . . . . . . 8 ⊢ ([⟨𝑉, 𝑊⟩ / 𝑥][𝑁 / 𝑛][𝐾 / 𝑦]𝜑 ↔ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)
11	8, 10	bitri 275	. . . . . . 7 ⊢ ([𝑁 / 𝑛][⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑 ↔ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)
12	11	anbi2i 624	. . . . . 6 ⊢ ((𝑁 ∈ 𝑉 ∧ [𝑁 / 𝑛][⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑) ↔ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑))
13	7, 12	bitri 275	. . . . 5 ⊢ (𝑁 ∈ {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} ↔ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑))
14	5, 13	bitrdi 287	. . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))
15	14	pm5.32da 579	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾)) ↔ (𝐾 ∈ 𝑉 ∧ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑))))
16		3anass 1095	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑) ↔ (𝐾 ∈ 𝑉 ∧ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))
17	15, 16	bitr4di 289	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾)) ↔ (𝐾 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))
18	3, 17	bitrd 279	1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ (𝐾 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  {crab 3401  Vcvv 3442  [wsbc 3742  ⟨cop 4588  ‘cfv 6502  (class class class)co 7370   ∈ cmpo 7372  1^st c1st 7943

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 2709  ax-sep 5245  ax-nul 5255  ax-pr 5381  ax-un 7692

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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fun 6504  df-fv 6510  df-ov 7373  df-oprab 7374  df-mpo 7375  df-1st 7945  df-2nd 7946

This theorem is referenced by: (None)