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

Theorem opelres 5858
Description: Ordered pair elementhood in a restriction. Exercise 13 of [TakeutiZaring] p. 25. (Contributed by NM, 13-Nov-1995.) (Revised by BJ, 18-Feb-2022.) Commute the consequent. (Revised by Peter Mazsa, 24-Sep-2022.)
Assertion
Ref Expression
opelres (𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))

Proof of Theorem opelres
StepHypRef Expression
1 df-res 5566 . . 3 (𝑅𝐴) = (𝑅 ∩ (𝐴 × V))
21elin2 4173 . 2 (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)))
3 elex 3512 . . . . 5 (𝐶𝑉𝐶 ∈ V)
43biantrud 534 . . . 4 (𝐶𝑉 → (𝐵𝐴 ↔ (𝐵𝐴𝐶 ∈ V)))
5 opelxp 5590 . . . 4 (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ (𝐵𝐴𝐶 ∈ V))
64, 5syl6rbbr 292 . . 3 (𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ 𝐵𝐴))
76anbi1cd 635 . 2 (𝐶𝑉 → ((⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))
82, 7syl5bb 285 1 (𝐶𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝑅𝐴) ↔ (𝐵𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wcel 2110  Vcvv 3494  cop 4572   × cxp 5552  cres 5556
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-opab 5128  df-xp 5560  df-res 5566
This theorem is referenced by:  brres  5859  opelresi  5860  opelidres  5864  h2hlm  28756  setsnidel  43536
  Copyright terms: Public domain W3C validator