 Mathbox for Jonathan Ben-Naim < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1113 Structured version   Visualization version   GIF version

Theorem bnj1113 29912
 Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj1113.1 (𝐴 = 𝐵𝐶 = 𝐷)
Assertion
Ref Expression
bnj1113 (𝐴 = 𝐵 𝑥𝐶 𝐸 = 𝑥𝐷 𝐸)
Distinct variable groups:   𝑥,𝐶   𝑥,𝐷
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐸(𝑥)

Proof of Theorem bnj1113
StepHypRef Expression
1 bnj1113.1 . 2 (𝐴 = 𝐵𝐶 = 𝐷)
21iuneq1d 4471 1 (𝐴 = 𝐵 𝑥𝐶 𝐸 = 𝑥𝐷 𝐸)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1474  ∪ ciun 4445 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2228  ax-ext 2585 This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-clab 2592  df-cleq 2598  df-clel 2601  df-nfc 2735  df-ral 2896  df-rex 2897  df-v 3170  df-in 3542  df-ss 3549  df-iun 4447 This theorem is referenced by:  bnj106  29994  bnj222  30009  bnj540  30018  bnj553  30024  bnj611  30044  bnj966  30070  bnj1112  30107
 Copyright terms: Public domain W3C validator