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

Theorem ex-opab 30920
Description: Example for df-opab 5172. Example by David A. Wheeler. (Contributed by Mario Carneiro, 18-Jun-2015.)
Assertion
Ref Expression
ex-opab (𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} → 3𝑅4)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝑅(𝑥, 𝑦)

Proof of Theorem ex-opab
StepHypRef Expression
1 3cn 12350 . . 3 3 ∈ ℂ
2 4cn 12354 . . 3 4 ∈ ℂ
3 3p1e4 12413 . . 3 (3 + 1) = 4
41elexi 3475 . . . 4 3 ∈ V
52elexi 3475 . . . 4 4 ∈ V
6 eleq1 2850 . . . . 5 (𝑥 = 3 → (𝑥 ∈ ℂ ↔ 3 ∈ ℂ))
7 oveq1 7424 . . . . . 6 (𝑥 = 3 → (𝑥 + 1) = (3 + 1))
87eqeq1d 2764 . . . . 5 (𝑥 = 3 → ((𝑥 + 1) = 𝑦 ↔ (3 + 1) = 𝑦))
96, 83anbi13d 1466 . . . 4 (𝑥 = 3 → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦) ↔ (3 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (3 + 1) = 𝑦)))
10 eleq1 2850 . . . . 5 (𝑦 = 4 → (𝑦 ∈ ℂ ↔ 4 ∈ ℂ))
11 eqeq2 2774 . . . . 5 (𝑦 = 4 → ((3 + 1) = 𝑦 ↔ (3 + 1) = 4))
1210, 113anbi23d 1467 . . . 4 (𝑦 = 4 → ((3 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (3 + 1) = 𝑦) ↔ (3 ∈ ℂ ∧ 4 ∈ ℂ ∧ (3 + 1) = 4)))
13 eqid 2762 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}
144, 5, 9, 12, 13brab 5526 . . 3 (3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4 ↔ (3 ∈ ℂ ∧ 4 ∈ ℂ ∧ (3 + 1) = 4))
151, 2, 3, 14mpbir3an 1360 . 2 3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4
16 breq 5109 . 2 (𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} → (3𝑅4 ↔ 3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4))
1715, 16mpbiri 261 1 (𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} → 3𝑅4)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  w3a 1103   = wceq 1570  wcel 2145   class class class wbr 5107  {copab 5171  (class class class)co 7417  cc 11126  1c1 11129   + caddc 11131  3c3 12324  4c4 12325
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 2734  ax-sep 5255  ax-pr 5402  ax-1cn 11186  ax-addcl 11188
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-iota 6493  df-fv 6545  df-ov 7420  df-2 12331  df-3 12332  df-4 12333
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator