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

Theorem eloprabg 7264
Description: The law of concretion for operation class abstraction. Compare elopab 5416. (Contributed by NM, 14-Sep-1999.) (Revised by David Abernethy, 19-Jun-2012.)
Hypotheses
Ref Expression
eloprabg.1 (𝑥 = 𝐴 → (𝜑𝜓))
eloprabg.2 (𝑦 = 𝐵 → (𝜓𝜒))
eloprabg.3 (𝑧 = 𝐶 → (𝜒𝜃))
Assertion
Ref Expression
eloprabg ((𝐴𝑉𝐵𝑊𝐶𝑋) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜃))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜃,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑥,𝑦,𝑧)   𝜒(𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)   𝑊(𝑥,𝑦,𝑧)   𝑋(𝑥,𝑦,𝑧)

Proof of Theorem eloprabg
StepHypRef Expression
1 eloprabg.1 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
2 eloprabg.2 . . 3 (𝑦 = 𝐵 → (𝜓𝜒))
3 eloprabg.3 . . 3 (𝑧 = 𝐶 → (𝜒𝜃))
41, 2, 3syl3an9b 1430 . 2 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝐶) → (𝜑𝜃))
54eloprabga 7263 1 ((𝐴𝑉𝐵𝑊𝐶𝑋) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  w3a 1083   = wceq 1537  wcel 2114  cop 4575  {coprab 7159
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-oprab 7162
This theorem is referenced by:  ov  7296  ovg  7315  brbtwn  26687  isnvlem  28389  isphg  28596  fvtransport  33495  brcolinear2  33521  colineardim1  33524  fvray  33604  fvline  33607
  Copyright terms: Public domain W3C validator