Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rp-fakeinunass Structured version   Visualization version   GIF version

Theorem rp-fakeinunass 44459
Description: A special case where a mixture of intersection and union appears to conform to a mixed associative law. (Contributed by RP, 26-Feb-2020.)
Assertion
Ref Expression
rp-fakeinunass (𝐶 ⊆ 𝐴 ↔ ((𝐴 ∩ 𝐵) ∪ 𝐶) = (𝐴 ∩ (𝐵 ∪ 𝐶)))

Proof of Theorem rp-fakeinunass
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 rp-fakeanorass 44457 . . 3 ((𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴) ↔ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶))))
21albii 1852 . 2 (∀𝑥(𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴) ↔ ∀𝑥(((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶))))
3 df-ss 3915 . 2 (𝐶 ⊆ 𝐴 ↔ ∀𝑥(𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴))
4 dfcleq 2753 . . 3 (((𝐴 ∩ 𝐵) ∪ 𝐶) = (𝐴 ∩ (𝐵 ∪ 𝐶)) ↔ ∀𝑥(𝑥 ∈ ((𝐴 ∩ 𝐵) ∪ 𝐶) ↔ 𝑥 ∈ (𝐴 ∩ (𝐵 ∪ 𝐶))))
5 elun 4099 . . . . . 6 (𝑥 ∈ ((𝐴 ∩ 𝐵) ∪ 𝐶) ↔ (𝑥 ∈ (𝐴 ∩ 𝐵) ∨ 𝑥 ∈ 𝐶))
6 elin 3914 . . . . . . 7 (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
76orbi1i 927 . . . . . 6 ((𝑥 ∈ (𝐴 ∩ 𝐵) ∨ 𝑥 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ 𝑥 ∈ 𝐶))
85, 7bitri 278 . . . . 5 (𝑥 ∈ ((𝐴 ∩ 𝐵) ∪ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ 𝑥 ∈ 𝐶))
9 elin 3914 . . . . . 6 (𝑥 ∈ (𝐴 ∩ (𝐵 ∪ 𝐶)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 ∪ 𝐶)))
10 elun 4099 . . . . . . 7 (𝑥 ∈ (𝐵 ∪ 𝐶) ↔ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶))
1110anbi2i 635 . . . . . 6 ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 ∪ 𝐶)) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶)))
129, 11bitri 278 . . . . 5 (𝑥 ∈ (𝐴 ∩ (𝐵 ∪ 𝐶)) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶)))
138, 12bibi12i 342 . . . 4 ((𝑥 ∈ ((𝐴 ∩ 𝐵) ∪ 𝐶) ↔ 𝑥 ∈ (𝐴 ∩ (𝐵 ∪ 𝐶))) ↔ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶))))
1413albii 1852 . . 3 (∀𝑥(𝑥 ∈ ((𝐴 ∩ 𝐵) ∪ 𝐶) ↔ 𝑥 ∈ (𝐴 ∩ (𝐵 ∪ 𝐶))) ↔ ∀𝑥(((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶))))
154, 14bitri 278 . 2 (((𝐴 ∩ 𝐵) ∪ 𝐶) = (𝐴 ∩ (𝐵 ∪ 𝐶)) ↔ ∀𝑥(((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∨ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶))))
162, 3, 153bitr4i 306 1 (𝐶 ⊆ 𝐴 ↔ ((𝐴 ∩ 𝐵) ∪ 𝐶) = (𝐴 ∩ (𝐵 ∪ 𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861  ∀wal 1568   = wceq 1570   ∈ wcel 2145   ∪ cun 3896   ∩ cin 3897   ⊆ wss 3898
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-un 3903  df-in 3905  df-ss 3915
This theorem is used by:  rp-fakeuninass  44460
  Copyright terms: Public domain W3C validator