Theorem fvopab3ig 5779

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 2301	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐶 ↔ 𝐴 ∈ 𝐶))
2		fvopab3ig.1	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
3	1, 2	anbi12d 477	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐶 ∧ 𝜑) ↔ (𝐴 ∈ 𝐶 ∧ 𝜓)))
4		fvopab3ig.2	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
5	4	anbi2d 468	. . . . . . 7 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝜓) ↔ (𝐴 ∈ 𝐶 ∧ 𝜒)))
6	3, 5	opelopabg 4410	. . . . . 6 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} ↔ (𝐴 ∈ 𝐶 ∧ 𝜒)))
7	6	biimpar 297	. . . . 5 ⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ (𝐴 ∈ 𝐶 ∧ 𝜒)) → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})
8	7	exp43 372	. . . 4 ⊢ (𝐴 ∈ 𝐶 → (𝐵 ∈ 𝐷 → (𝐴 ∈ 𝐶 → (𝜒 → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}))))
9	8	pm2.43a 51	. . 3 ⊢ (𝐴 ∈ 𝐶 → (𝐵 ∈ 𝐷 → (𝜒 → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})))
10	9	imp 124	. 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝜒 → ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}))
11		fvopab3ig.4	. . . 4 ⊢ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}
12	11	fveq1i 5696	. . 3 ⊢ (𝐹‘𝐴) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}‘𝐴)
13		funopab 5412	. . . . 5 ⊢ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐶 ∧ 𝜑))
14		fvopab3ig.3	. . . . . 6 ⊢ (𝑥 ∈ 𝐶 → ∃*𝑦𝜑)
15		moanimv 2162	. . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ 𝐶 ∧ 𝜑) ↔ (𝑥 ∈ 𝐶 → ∃*𝑦𝜑))
16	14, 15	mpbir 146	. . . . 5 ⊢ ∃*𝑦(𝑥 ∈ 𝐶 ∧ 𝜑)
17	13, 16	mpgbir 1506	. . . 4 ⊢ Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}
18		funopfv 5740	. . . 4 ⊢ (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}‘𝐴) = 𝐵))
19	17, 18	ax-mp 5	. . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}‘𝐴) = 𝐵)
20	12, 19	eqtrid 2283	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} → (𝐹‘𝐴) = 𝐵)
21	10, 20	syl6 33	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝜒 → (𝐹‘𝐴) = 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃*wmo 2087   ∈ wcel 2209  ⟨cop 3712  {copab 4191  Fun wfun 5371  ‘cfv 5377

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385

This theorem is used by:  fvmptg  5781  fvopab6  5805  ov6g  6227