Theorem fgraphxp 42681

Description: Express a function as a subset of the Cartesian product. (Contributed by Stefan O'Rear, 25-Jan-2015.)

Assertion

Ref	Expression
fgraphxp	⊢ (𝐹:𝐴⟶𝐵 → 𝐹 = {𝑥 ∈ (𝐴 × 𝐵) ∣ (𝐹‘(1st ‘𝑥)) = (2nd ‘𝑥)})

Distinct variable groups:   𝑥,𝐹   𝑥,𝐴   𝑥,𝐵

Proof of Theorem fgraphxp

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fgraphopab 42680	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝐹‘𝑎) = 𝑏)})
2		vex 3477	. . . . . . 7 ⊢ 𝑎 ∈ V
3		vex 3477	. . . . . . 7 ⊢ 𝑏 ∈ V
4	2, 3	op1std 8011	. . . . . 6 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (1st ‘𝑥) = 𝑎)
5	4	fveq2d 6906	. . . . 5 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (𝐹‘(1st ‘𝑥)) = (𝐹‘𝑎))
6	2, 3	op2ndd 8012	. . . . 5 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (2nd ‘𝑥) = 𝑏)
7	5, 6	eqeq12d 2744	. . . 4 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → ((𝐹‘(1st ‘𝑥)) = (2nd ‘𝑥) ↔ (𝐹‘𝑎) = 𝑏))
8	7	rabxp 5730	. . 3 ⊢ {𝑥 ∈ (𝐴 × 𝐵) ∣ (𝐹‘(1st ‘𝑥)) = (2nd ‘𝑥)} = {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ (𝐹‘𝑎) = 𝑏)}
9		df-3an 1086	. . . 4 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ (𝐹‘𝑎) = 𝑏) ↔ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝐹‘𝑎) = 𝑏))
10	9	opabbii 5219	. . 3 ⊢ {⟨𝑎, 𝑏⟩ ∣ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵 ∧ (𝐹‘𝑎) = 𝑏)} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝐹‘𝑎) = 𝑏)}
11	8, 10	eqtri 2756	. 2 ⊢ {𝑥 ∈ (𝐴 × 𝐵) ∣ (𝐹‘(1st ‘𝑥)) = (2nd ‘𝑥)} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝐹‘𝑎) = 𝑏)}
12	1, 11	eqtr4di 2786	1 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 = {𝑥 ∈ (𝐴 × 𝐵) ∣ (𝐹‘(1st ‘𝑥)) = (2nd ‘𝑥)})

Syntax hints:   → wi 4   ∧ wa 394   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098  {crab 3430  ⟨cop 4638  {copab 5214   × cxp 5680  ⟶wf 6549  ‘cfv 6553  1^st c1st 7999  2^nd c2nd 8000

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pr 5433  ax-un 7748

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3431  df-v 3475  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-fv 6561  df-1st 8001  df-2nd 8002

This theorem is referenced by:  hausgraph  42682