Theorem ovid 7552

Description: The value of an operation class abstraction. (Contributed by NM, 16-May-1995.) (Revised by David Abernethy, 19-Jun-2012.)

Hypotheses

Ref	Expression
ovid.1	⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃!𝑧𝜑)
ovid.2	⊢ 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)}

Assertion

Ref	Expression
ovid	⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = 𝑧 ↔ 𝜑))

Distinct variable groups:   𝑥,𝑦,𝑧   𝑧,𝑅   𝑧,𝑆

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝑅(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝐹(𝑥,𝑦,𝑧)

Proof of Theorem ovid

Step	Hyp	Ref	Expression
1		df-ov 7415	. . 3 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
2	1	eqeq1i 2736	. 2 ⊢ ((𝑥𝐹𝑦) = 𝑧 ↔ (𝐹‘⟨𝑥, 𝑦⟩) = 𝑧)
3		ovid.1	. . . . . 6 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃!𝑧𝜑)
4	3	fnoprab 7537	. . . . 5 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)}
5		ovid.2	. . . . . 6 ⊢ 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)}
6	5	fneq1i 6646	. . . . 5 ⊢ (𝐹 Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)} ↔ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)})
7	4, 6	mpbir 230	. . . 4 ⊢ 𝐹 Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)}
8		opabidw 5524	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)} ↔ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆))
9	8	biimpri 227	. . . 4 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)})
10		fnopfvb 6945	. . . 4 ⊢ ((𝐹 Fn {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)} ∧ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)}) → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐹))
11	7, 9, 10	sylancr 586	. . 3 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐹))
12	5	eleq2i 2824	. . . . 5 ⊢ (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐹 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)})
13		oprabidw 7443	. . . . 5 ⊢ (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} ↔ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑))
14	12, 13	bitri 275	. . . 4 ⊢ (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐹 ↔ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑))
15	14	baib 535	. . 3 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐹 ↔ 𝜑))
16	11, 15	bitrd 279	. 2 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ((𝐹‘⟨𝑥, 𝑦⟩) = 𝑧 ↔ 𝜑))
17	2, 16	bitrid 283	1 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = 𝑧 ↔ 𝜑))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1540   ∈ wcel 2105  ∃!weu 2561  ⟨cop 4634  {copab 5210   Fn wfn 6538  ‘cfv 6543  (class class class)co 7412  {coprab 7413

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-iota 6495  df-fun 6545  df-fn 6546  df-fv 6551  df-ov 7415  df-oprab 7416

This theorem is referenced by: (None)