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

Theorem unjust 4149
Description: Soundness justification theorem for df-un 4150. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
unjust {𝑥 ∣ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)}
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑦,𝐴   𝑦,𝐵

Proof of Theorem unjust
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eleq1w 2843 . . . 4 (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
2 eleq1w 2843 . . . 4 (𝑥 = 𝑧 → (𝑥 ∈ 𝐵 ↔ 𝑧 ∈ 𝐵))
31, 2orbi12d 932 . . 3 (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ (𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝐵)))
43cbvabv 2830 . 2 {𝑥 ∣ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)} = {𝑧 ∣ (𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝐵)}
5 eleq1w 2843 . . . 4 (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
6 eleq1w 2843 . . . 4 (𝑧 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
75, 6orbi12d 932 . . 3 (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝐵) ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)))
87cbvabv 2830 . 2 {𝑧 ∣ (𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)}
94, 8eqtri 2783 1 {𝑥 ∣ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∨ wo 861   = wceq 1569   ∈ wcel 2144  {cab 2738
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator