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 30507
Description: Example for df-opab 5161. 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 12226 . . 3 3 ∈ ℂ
2 4cn 12230 . . 3 4 ∈ ℂ
3 3p1e4 12285 . . 3 (3 + 1) = 4
41elexi 3463 . . . 4 3 ∈ V
52elexi 3463 . . . 4 4 ∈ V
6 eleq1 2824 . . . . 5 (𝑥 = 3 → (𝑥 ∈ ℂ ↔ 3 ∈ ℂ))
7 oveq1 7365 . . . . . 6 (𝑥 = 3 → (𝑥 + 1) = (3 + 1))
87eqeq1d 2738 . . . . 5 (𝑥 = 3 → ((𝑥 + 1) = 𝑦 ↔ (3 + 1) = 𝑦))
96, 83anbi13d 1440 . . . 4 (𝑥 = 3 → ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦) ↔ (3 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (3 + 1) = 𝑦)))
10 eleq1 2824 . . . . 5 (𝑦 = 4 → (𝑦 ∈ ℂ ↔ 4 ∈ ℂ))
11 eqeq2 2748 . . . . 5 (𝑦 = 4 → ((3 + 1) = 𝑦 ↔ (3 + 1) = 4))
1210, 113anbi23d 1441 . . . 4 (𝑦 = 4 → ((3 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (3 + 1) = 𝑦) ↔ (3 ∈ ℂ ∧ 4 ∈ ℂ ∧ (3 + 1) = 4)))
13 eqid 2736 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}
144, 5, 9, 12, 13brab 5491 . . 3 (3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4 ↔ (3 ∈ ℂ ∧ 4 ∈ ℂ ∧ (3 + 1) = 4))
151, 2, 3, 14mpbir3an 1342 . 2 3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4
16 breq 5100 . 2 (𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} → (3𝑅4 ↔ 3{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)}4))
1715, 16mpbiri 258 1 (𝑅 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ (𝑥 + 1) = 𝑦)} → 3𝑅4)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1541  wcel 2113   class class class wbr 5098  {copab 5160  (class class class)co 7358  cc 11024  1c1 11027   + caddc 11029  3c3 12201  4c4 12202
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-1cn 11084  ax-addcl 11086
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-iota 6448  df-fv 6500  df-ov 7361  df-2 12208  df-3 12209  df-4 12210
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator