Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brabidga Structured version   Visualization version   GIF version

Theorem brabidga 39574
Description: The law of concretion for a binary relation. Special case of brabga 5514. Usage of this theorem is discouraged because it depends on ax-13 2407, see brabidgaw 39573 for a weaker version that does not require it. (Contributed by Peter Mazsa, 24-Nov-2018.) (New usage is discouraged.)
Hypothesis
Ref Expression
brabidga.1 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
Assertion
Ref Expression
brabidga (𝑥𝑅𝑦 ↔ 𝜑)

Proof of Theorem brabidga
StepHypRef Expression
1 brabidga.1 . . 3 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
21breqi 5113 . 2 (𝑥𝑅𝑦 ↔ 𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑦)
3 df-br 5108 . 2 (𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
4 opabid 5505 . 2 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
52, 3, 43bitri 300 1 (𝑥𝑅𝑦 ↔ 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1572   ∈ wcel 2150  ⟨cop 4839   class class class wbr 5107  {copab 5172
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-12 2219  ax-13 2407  ax-ext 2738  ax-sep 5254  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-br 5108  df-opab 5173
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator