Mathbox for Stefan O'Rear < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fgraphopab Structured version   Visualization version   GIF version

Theorem fgraphopab 40084
 Description: Express a function as a subset of the Cartesian product. (Contributed by Stefan O'Rear, 25-Jan-2015.)
Assertion
Ref Expression
fgraphopab (𝐹:𝐴𝐵𝐹 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎𝐴𝑏𝐵) ∧ (𝐹𝑎) = 𝑏)})
Distinct variable groups:   𝐹,𝑎,𝑏   𝐴,𝑎,𝑏   𝐵,𝑎,𝑏

Proof of Theorem fgraphopab
StepHypRef Expression
1 fssxp 6515 . . . 4 (𝐹:𝐴𝐵𝐹 ⊆ (𝐴 × 𝐵))
2 df-ss 3925 . . . 4 (𝐹 ⊆ (𝐴 × 𝐵) ↔ (𝐹 ∩ (𝐴 × 𝐵)) = 𝐹)
31, 2sylib 221 . . 3 (𝐹:𝐴𝐵 → (𝐹 ∩ (𝐴 × 𝐵)) = 𝐹)
4 ffn 6494 . . . . 5 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
5 dffn5 6706 . . . . 5 (𝐹 Fn 𝐴𝐹 = (𝑎𝐴 ↦ (𝐹𝑎)))
64, 5sylib 221 . . . 4 (𝐹:𝐴𝐵𝐹 = (𝑎𝐴 ↦ (𝐹𝑎)))
76ineq1d 4162 . . 3 (𝐹:𝐴𝐵 → (𝐹 ∩ (𝐴 × 𝐵)) = ((𝑎𝐴 ↦ (𝐹𝑎)) ∩ (𝐴 × 𝐵)))
83, 7eqtr3d 2859 . 2 (𝐹:𝐴𝐵𝐹 = ((𝑎𝐴 ↦ (𝐹𝑎)) ∩ (𝐴 × 𝐵)))
9 df-mpt 5123 . . . 4 (𝑎𝐴 ↦ (𝐹𝑎)) = {⟨𝑎, 𝑏⟩ ∣ (𝑎𝐴𝑏 = (𝐹𝑎))}
10 df-xp 5538 . . . 4 (𝐴 × 𝐵) = {⟨𝑎, 𝑏⟩ ∣ (𝑎𝐴𝑏𝐵)}
119, 10ineq12i 4161 . . 3 ((𝑎𝐴 ↦ (𝐹𝑎)) ∩ (𝐴 × 𝐵)) = ({⟨𝑎, 𝑏⟩ ∣ (𝑎𝐴𝑏 = (𝐹𝑎))} ∩ {⟨𝑎, 𝑏⟩ ∣ (𝑎𝐴𝑏𝐵)})
12 inopab 5678 . . 3 ({⟨𝑎, 𝑏⟩ ∣ (𝑎𝐴𝑏 = (𝐹𝑎))} ∩ {⟨𝑎, 𝑏⟩ ∣ (𝑎𝐴𝑏𝐵)}) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎𝐴𝑏 = (𝐹𝑎)) ∧ (𝑎𝐴𝑏𝐵))}
13 anandi 675 . . . . 5 ((𝑎𝐴 ∧ (𝑏 = (𝐹𝑎) ∧ 𝑏𝐵)) ↔ ((𝑎𝐴𝑏 = (𝐹𝑎)) ∧ (𝑎𝐴𝑏𝐵)))
14 ancom 464 . . . . . . 7 ((𝑏 = (𝐹𝑎) ∧ 𝑏𝐵) ↔ (𝑏𝐵𝑏 = (𝐹𝑎)))
1514anbi2i 625 . . . . . 6 ((𝑎𝐴 ∧ (𝑏 = (𝐹𝑎) ∧ 𝑏𝐵)) ↔ (𝑎𝐴 ∧ (𝑏𝐵𝑏 = (𝐹𝑎))))
16 anass 472 . . . . . 6 (((𝑎𝐴𝑏𝐵) ∧ 𝑏 = (𝐹𝑎)) ↔ (𝑎𝐴 ∧ (𝑏𝐵𝑏 = (𝐹𝑎))))
17 eqcom 2829 . . . . . . 7 (𝑏 = (𝐹𝑎) ↔ (𝐹𝑎) = 𝑏)
1817anbi2i 625 . . . . . 6 (((𝑎𝐴𝑏𝐵) ∧ 𝑏 = (𝐹𝑎)) ↔ ((𝑎𝐴𝑏𝐵) ∧ (𝐹𝑎) = 𝑏))
1915, 16, 183bitr2i 302 . . . . 5 ((𝑎𝐴 ∧ (𝑏 = (𝐹𝑎) ∧ 𝑏𝐵)) ↔ ((𝑎𝐴𝑏𝐵) ∧ (𝐹𝑎) = 𝑏))
2013, 19bitr3i 280 . . . 4 (((𝑎𝐴𝑏 = (𝐹𝑎)) ∧ (𝑎𝐴𝑏𝐵)) ↔ ((𝑎𝐴𝑏𝐵) ∧ (𝐹𝑎) = 𝑏))
2120opabbii 5109 . . 3 {⟨𝑎, 𝑏⟩ ∣ ((𝑎𝐴𝑏 = (𝐹𝑎)) ∧ (𝑎𝐴𝑏𝐵))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎𝐴𝑏𝐵) ∧ (𝐹𝑎) = 𝑏)}
2211, 12, 213eqtri 2849 . 2 ((𝑎𝐴 ↦ (𝐹𝑎)) ∩ (𝐴 × 𝐵)) = {⟨𝑎, 𝑏⟩ ∣ ((𝑎𝐴𝑏𝐵) ∧ (𝐹𝑎) = 𝑏)}
238, 22syl6eq 2873 1 (𝐹:𝐴𝐵𝐹 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎𝐴𝑏𝐵) ∧ (𝐹𝑎) = 𝑏)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2114   ∩ cin 3907   ⊆ wss 3908  {copab 5104   ↦ cmpt 5122   × cxp 5530   Fn wfn 6329  ⟶wf 6330  ‘cfv 6334 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pr 5307 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-fv 6342 This theorem is referenced by:  fgraphxp  40085
 Copyright terms: Public domain W3C validator