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 30692
Description: Example for df-opab 5168. 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 12313 . . 3 3 ∈ ℂ
2 4cn 12317 . . 3 4 ∈ ℂ
3 3p1e4 12376 . . 3 (3 + 1) = 4
41elexi 3479 . . . 4 3 ∈ V
52elexi 3479 . . . 4 4 ∈ V
6 eleq1 2853 . . . . 5 (𝑥 = 3 → (𝑥 ∈ ℂ ↔ 3 ∈ ℂ))
7 oveq1 7407 . . . . . 6 (𝑥 = 3 → (𝑥 + 1) = (3 + 1))
87eqeq1d 2767 . . . . 5 (𝑥 = 3 → ((𝑥 + 1) = 𝑦 ↔ (3 + 1) = 𝑦))
96, 83anbi13d 1462 . . . 4 (𝑥 = 3 → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦) ↔ (3 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (3 + 1) = 𝑦)))
10 eleq1 2853 . . . . 5 (𝑦 = 4 → (𝑦 ∈ ℂ ↔ 4 ∈ ℂ))
11 eqeq2 2777 . . . . 5 (𝑦 = 4 → ((3 + 1) = 𝑦 ↔ (3 + 1) = 4))
1210, 113anbi23d 1463 . . . 4 (𝑦 = 4 → ((3 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (3 + 1) = 𝑦) ↔ (3 ∈ ℂ ∧ 4 ∈ ℂ ∧ (3 + 1) = 4)))
13 eqid 2765 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}
144, 5, 9, 12, 13brab 5519 . . 3 (3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4 ↔ (3 ∈ ℂ ∧ 4 ∈ ℂ ∧ (3 + 1) = 4))
151, 2, 3, 14mpbir3an 1358 . 2 3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4
16 breq 5107 . 2 (𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} → (3𝑅4 ↔ 3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4))
1715, 16mpbiri 261 1 (𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} → 3𝑅4)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1101   = wceq 1563  wcel 2145   class class class wbr 5105  {copab 5167  (class class class)co 7400  cc 11086  1c1 11089   + caddc 11091  3c3 12287  4c4 12288
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395  ax-1cn 11146  ax-addcl 11148
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-iota 6481  df-fv 6533  df-ov 7403  df-2 12294  df-3 12295  df-4 12296
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator