MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfres3 Structured version   Visualization version   GIF version

Theorem dfres3 5885
Description: Alternate definition of restriction. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
Assertion
Ref Expression
dfres3 (𝐴𝐵) = (𝐴 ∩ (𝐵 × ran 𝐴))

Proof of Theorem dfres3
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-res 5592 . 2 (𝐴𝐵) = (𝐴 ∩ (𝐵 × V))
2 eleq1 2826 . . . . . . . . . 10 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥𝐴 ↔ ⟨𝑦, 𝑧⟩ ∈ 𝐴))
3 vex 3426 . . . . . . . . . . . 12 𝑧 ∈ V
43biantru 529 . . . . . . . . . . 11 (𝑦𝐵 ↔ (𝑦𝐵𝑧 ∈ V))
5 vex 3426 . . . . . . . . . . . . 13 𝑦 ∈ V
65, 3opelrn 5841 . . . . . . . . . . . 12 (⟨𝑦, 𝑧⟩ ∈ 𝐴𝑧 ∈ ran 𝐴)
76biantrud 531 . . . . . . . . . . 11 (⟨𝑦, 𝑧⟩ ∈ 𝐴 → (𝑦𝐵 ↔ (𝑦𝐵𝑧 ∈ ran 𝐴)))
84, 7bitr3id 284 . . . . . . . . . 10 (⟨𝑦, 𝑧⟩ ∈ 𝐴 → ((𝑦𝐵𝑧 ∈ V) ↔ (𝑦𝐵𝑧 ∈ ran 𝐴)))
92, 8syl6bi 252 . . . . . . . . 9 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥𝐴 → ((𝑦𝐵𝑧 ∈ V) ↔ (𝑦𝐵𝑧 ∈ ran 𝐴))))
109com12 32 . . . . . . . 8 (𝑥𝐴 → (𝑥 = ⟨𝑦, 𝑧⟩ → ((𝑦𝐵𝑧 ∈ V) ↔ (𝑦𝐵𝑧 ∈ ran 𝐴))))
1110pm5.32d 576 . . . . . . 7 (𝑥𝐴 → ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ V)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ ran 𝐴))))
12112exbidv 1928 . . . . . 6 (𝑥𝐴 → (∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ V)) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ ran 𝐴))))
13 elxp 5603 . . . . . 6 (𝑥 ∈ (𝐵 × V) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ V)))
14 elxp 5603 . . . . . 6 (𝑥 ∈ (𝐵 × ran 𝐴) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐵𝑧 ∈ ran 𝐴)))
1512, 13, 143bitr4g 313 . . . . 5 (𝑥𝐴 → (𝑥 ∈ (𝐵 × V) ↔ 𝑥 ∈ (𝐵 × ran 𝐴)))
1615pm5.32i 574 . . . 4 ((𝑥𝐴𝑥 ∈ (𝐵 × V)) ↔ (𝑥𝐴𝑥 ∈ (𝐵 × ran 𝐴)))
17 elin 3899 . . . 4 (𝑥 ∈ (𝐴 ∩ (𝐵 × ran 𝐴)) ↔ (𝑥𝐴𝑥 ∈ (𝐵 × ran 𝐴)))
1816, 17bitr4i 277 . . 3 ((𝑥𝐴𝑥 ∈ (𝐵 × V)) ↔ 𝑥 ∈ (𝐴 ∩ (𝐵 × ran 𝐴)))
1918ineqri 4135 . 2 (𝐴 ∩ (𝐵 × V)) = (𝐴 ∩ (𝐵 × ran 𝐴))
201, 19eqtri 2766 1 (𝐴𝐵) = (𝐴 ∩ (𝐵 × ran 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395   = wceq 1539  wex 1783  wcel 2108  Vcvv 3422  cin 3882  cop 4564   × cxp 5578  ran crn 5581  cres 5582
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-xp 5586  df-cnv 5588  df-dm 5590  df-rn 5591  df-res 5592
This theorem is referenced by:  brrestrict  34178  dfrel6  36409
  Copyright terms: Public domain W3C validator