Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  equncomVD Structured version   Visualization version   GIF version

Theorem equncomVD 46110
Description: If a class equals the union of two other classes, then it equals the union of those two classes commuted. The following User's Proof is a Virtual Deduction proof completed automatically by the tools program completeusersproof.cmd, which invokes Mel L. O'Cat's mmj2 and Norm Megill's Metamath Proof Assistant. equncom 4161 is equncomVD 46110 without virtual deductions and was automatically derived from equncomVD 46110.
1:: (   𝐴 = (𝐵 ∪ 𝐶)   ▶   𝐴 = (𝐵 ∪ 𝐶)   )
2:: (𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵)
3:1,2: (   𝐴 = (𝐵 ∪ 𝐶)   ▶   𝐴 = (𝐶 ∪ 𝐵)   )
4:3: (𝐴 = (𝐵 ∪ 𝐶) → 𝐴 = (𝐶 ∪ 𝐵))
5:: (   𝐴 = (𝐶 ∪ 𝐵)   ▶   𝐴 = (𝐶 ∪ 𝐵)   )
6:5,2: (   𝐴 = (𝐶 ∪ 𝐵)   ▶   𝐴 = (𝐵 ∪ 𝐶)   )
7:6: (𝐴 = (𝐶 ∪ 𝐵) → 𝐴 = (𝐵 ∪ 𝐶))
8:4,7: (𝐴 = (𝐵 ∪ 𝐶) ↔ 𝐴 = (𝐶 ∪ 𝐵))
(Contributed by Alan Sare, 17-Feb-2012.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
equncomVD (𝐴 = (𝐵 ∪ 𝐶) ↔ 𝐴 = (𝐶 ∪ 𝐵))

Proof of Theorem equncomVD
StepHypRef Expression
1 idn1 45817 . . . 4 (   𝐴 = (𝐵 ∪ 𝐶)   ▶   𝐴 = (𝐵 ∪ 𝐶)   )
2 uncom 4160 . . . 4 (𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵)
3 eqeq1 2767 . . . . 5 (𝐴 = (𝐵 ∪ 𝐶) → (𝐴 = (𝐶 ∪ 𝐵) ↔ (𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵)))
43biimprd 251 . . . 4 (𝐴 = (𝐵 ∪ 𝐶) → ((𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵) → 𝐴 = (𝐶 ∪ 𝐵)))
51, 2, 4e10 45937 . . 3 (   𝐴 = (𝐵 ∪ 𝐶)   ▶   𝐴 = (𝐶 ∪ 𝐵)   )
65in1 45814 . 2 (𝐴 = (𝐵 ∪ 𝐶) → 𝐴 = (𝐶 ∪ 𝐵))
7 idn1 45817 . . . 4 (   𝐴 = (𝐶 ∪ 𝐵)   ▶   𝐴 = (𝐶 ∪ 𝐵)   )
8 eqeq2 2775 . . . . 5 ((𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵) → (𝐴 = (𝐵 ∪ 𝐶) ↔ 𝐴 = (𝐶 ∪ 𝐵)))
98biimprcd 253 . . . 4 (𝐴 = (𝐶 ∪ 𝐵) → ((𝐵 ∪ 𝐶) = (𝐶 ∪ 𝐵) → 𝐴 = (𝐵 ∪ 𝐶)))
107, 2, 9e10 45937 . . 3 (   𝐴 = (𝐶 ∪ 𝐵)   ▶   𝐴 = (𝐵 ∪ 𝐶)   )
1110in1 45814 . 2 (𝐴 = (𝐶 ∪ 𝐵) → 𝐴 = (𝐵 ∪ 𝐶))
126, 11impbii 212 1 (𝐴 = (𝐵 ∪ 𝐶) ↔ 𝐴 = (𝐶 ∪ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∪ cun 4152
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-un 4154  df-vd1 45813
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator