Theorem fvopab3ig 7020

Description: Value of a function given by ordered-pair class abstraction. (Contributed by NM, 23-Oct-1999.)

Hypotheses

Ref	Expression
fvopab3ig.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
fvopab3ig.2	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
fvopab3ig.3	⊢ (𝑥 ∈ 𝐶 → ∃*𝑦𝜑)
fvopab3ig.4	⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}

Assertion

Ref	Expression
fvopab3ig	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝜒 → (𝐹‘𝐴) = 𝐵))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝜒,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)   𝐷(𝑥, 𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem fvopab3ig

Step	Hyp	Ref	Expression
1		eleq1 2852	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐶 ↔ 𝐴 ∈ 𝐶))
2		fvopab3ig.1	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
3	1, 2	anbi12d 644	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐶 ∧ 𝜑) ↔ (𝐴 ∈ 𝐶 ∧ 𝜓)))
4		fvopab3ig.2	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
5	4	anbi2d 642	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝜓) ↔ (𝐴 ∈ 𝐶 ∧ 𝜒)))
6	3, 5	opelopabg 5520	. . . . . 6 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} ↔ (𝐴 ∈ 𝐶 ∧ 𝜒)))
7	6	biimpar 483	. . . . 5 ⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝜒)) → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})
8	7	exp43 442	. . . 4 ⊢ (𝐴 ∈ 𝐶 → (𝐵 ∈ 𝐷 → (𝐴 ∈ 𝐶 → (𝜒 → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}))))
9	8	pm2.43a 55	. . 3 ⊢ (𝐴 ∈ 𝐶 → (𝐵 ∈ 𝐷 → (𝜒 → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})))
10	9	imp 412	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝜒 → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}))
11		fvopab3ig.4	. . . 4 ⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}
12	11	fveq1i 6917	. . 3 ⊢ (𝐹‘𝐴) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}‘𝐴)
13		funopab 6603	. . . . 5 ⊢ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐶 ∧ 𝜑))
14		fvopab3ig.3	. . . . . 6 ⊢ (𝑥 ∈ 𝐶 → ∃*𝑦𝜑)
15		moanimv 2647	. . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ 𝐶 ∧ 𝜑) ↔ (𝑥 ∈ 𝐶 → ∃*𝑦𝜑))
16	14, 15	mpbir 234	. . . . 5 ⊢ ∃*𝑦(𝑥 ∈ 𝐶 ∧ 𝜑)
17	13, 16	mpgbir 1832	. . . 4 ⊢ Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}
18		funopfv 6965	. . . 4 ⊢ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}‘𝐴) = 𝐵))
19	17, 18	ax-mp 5	. . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}‘𝐴) = 𝐵)
20	12, 19	eqtrid 2810	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} → (𝐹‘𝐴) = 𝐵)
21	10, 20	syl6 36	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝜒 → (𝐹‘𝐴) = 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃*wmo 2565  ⟨cop 4840  {copab 5173  Fun wfun 6560  ‘cfv 6566

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574

This theorem is used by:  fvmptg  7022  fvopab6  7059  ov6g  7616  mpt3fvd  7720  mpofvd  35838