Theorem mpoxopovel 8237

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 8230	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) → 𝐾 ∈ 𝑉))
3	2	pm4.71rd 572	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ (𝐾 ∈ 𝑉 ∧ 𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾))))
4	1	mpoxopoveq 8236	. . . . . 6 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (⟨𝑉, 𝑊⟩𝐹𝐾) = {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑})
5	4	eleq2d 2846	. . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ 𝑁 ∈ {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑}))
6		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑛𝑉
7	6	elrabsf 3783	. . . . . 6 ⊢ (𝑁 ∈ {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} ↔ (𝑁 ∈ 𝑉 ∧ [𝑁 / 𝑛][⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑))
8		sbccom 3817	. . . . . . . 8 ⊢ ([𝑁 / 𝑛][⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑 ↔ [⟨𝑉, 𝑊⟩ / 𝑥][𝑁 / 𝑛][𝐾 / 𝑦]𝜑)
9		sbccom 3817	. . . . . . . . 9 ⊢ ([𝑁 / 𝑛][𝐾 / 𝑦]𝜑 ↔ [𝐾 / 𝑦][𝑁 / 𝑛]𝜑)
10	9	sbcbii 3794	. . . . . . . 8 ⊢ ([⟨𝑉, 𝑊⟩ / 𝑥][𝑁 / 𝑛][𝐾 / 𝑦]𝜑 ↔ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)
11	8, 10	bitri 278	. . . . . . 7 ⊢ ([𝑁 / 𝑛][⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑 ↔ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)
12	11	anbi2i 635	. . . . . 6 ⊢ ((𝑁 ∈ 𝑉 ∧ [𝑁 / 𝑛][⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑) ↔ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑))
13	7, 12	bitri 278	. . . . 5 ⊢ (𝑁 ∈ {𝑛 ∈ 𝑉 ∣ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦]𝜑} ↔ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑))
14	5, 13	bitrdi 290	. . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ 𝐾 ∈ 𝑉) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))
15	14	pm5.32da 590	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾)) ↔ (𝐾 ∈ 𝑉 ∧ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑))))
16		3anass 1111	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑) ↔ (𝐾 ∈ 𝑉 ∧ (𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))
17	15, 16	bitr4di 292	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾)) ↔ (𝐾 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))
18	3, 17	bitrd 282	1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑁 ∈ (⟨𝑉, 𝑊⟩𝐹𝐾) ↔ (𝐾 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉 ∧ [⟨𝑉, 𝑊⟩ / 𝑥][𝐾 / 𝑦][𝑁 / 𝑛]𝜑)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450  [wsbc 3738  ⟨cop 4589  ‘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 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  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: (None)