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

Theorem ex-br 30914
Description: Example for df-br 5104. Example by David A. Wheeler. (Contributed by Mario Carneiro, 6-May-2015.)
Assertion
Ref Expression
ex-br (𝑅 = {⟨2, 6⟩, ⟨3, 9⟩} → 3𝑅9)

Proof of Theorem ex-br
StepHypRef Expression
1 opex 5439 . . . 4 ⟨3, 9⟩ ∈ V
21prid2 4724 . . 3 ⟨3, 9⟩ ∈ {⟨2, 6⟩, ⟨3, 9⟩}
3 id 23 . . 3 (𝑅 = {⟨2, 6⟩, ⟨3, 9⟩} → 𝑅 = {⟨2, 6⟩, ⟨3, 9⟩})
42, 3eleqtrrid 2867 . 2 (𝑅 = {⟨2, 6⟩, ⟨3, 9⟩} → ⟨3, 9⟩ ∈ 𝑅)
5 df-br 5104 . 2 (3𝑅9 ↔ ⟨3, 9⟩ ∈ 𝑅)
64, 5sylibr 237 1 (𝑅 = {⟨2, 6⟩, ⟨3, 9⟩} → 3𝑅9)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  {cpr 4586  cop 4590   class class class wbr 5103  2c2 12322  3c3 12323  6c6 12326  9c9 12329
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-un 3904  df-in 3906  df-ss 3916  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator