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

Theorem uniinqs 8811
Description: Class union distributes over the intersection of two subclasses of a quotient space. Compare uniin 4907. (Contributed by FL, 25-May-2007.) (Proof shortened by Mario Carneiro, 11-Jul-2014.)
Hypothesis
Ref Expression
uniinqs.1 𝑅 Er 𝑋
Assertion
Ref Expression
uniinqs ((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) → (𝐵𝐶) = ( 𝐵 𝐶))

Proof of Theorem uniinqs
Dummy variables 𝑏 𝑐 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uniin 4907 . . 3 (𝐵𝐶) ⊆ ( 𝐵 𝐶)
21a1i 11 . 2 ((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) → (𝐵𝐶) ⊆ ( 𝐵 𝐶))
3 eluni2 4887 . . . . . 6 (𝑥 𝐵 ↔ ∃𝑏𝐵 𝑥𝑏)
4 eluni2 4887 . . . . . 6 (𝑥 𝐶 ↔ ∃𝑐𝐶 𝑥𝑐)
53, 4anbi12i 628 . . . . 5 ((𝑥 𝐵𝑥 𝐶) ↔ (∃𝑏𝐵 𝑥𝑏 ∧ ∃𝑐𝐶 𝑥𝑐))
6 elin 3942 . . . . 5 (𝑥 ∈ ( 𝐵 𝐶) ↔ (𝑥 𝐵𝑥 𝐶))
7 reeanv 3213 . . . . 5 (∃𝑏𝐵𝑐𝐶 (𝑥𝑏𝑥𝑐) ↔ (∃𝑏𝐵 𝑥𝑏 ∧ ∃𝑐𝐶 𝑥𝑐))
85, 6, 73bitr4i 303 . . . 4 (𝑥 ∈ ( 𝐵 𝐶) ↔ ∃𝑏𝐵𝑐𝐶 (𝑥𝑏𝑥𝑐))
9 simp3l 1202 . . . . . . 7 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑥𝑏)
10 simp2l 1200 . . . . . . . 8 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑏𝐵)
11 inelcm 4440 . . . . . . . . . . 11 ((𝑥𝑏𝑥𝑐) → (𝑏𝑐) ≠ ∅)
12113ad2ant3 1135 . . . . . . . . . 10 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → (𝑏𝑐) ≠ ∅)
13 uniinqs.1 . . . . . . . . . . . . . 14 𝑅 Er 𝑋
1413a1i 11 . . . . . . . . . . . . 13 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑅 Er 𝑋)
15 simp1l 1198 . . . . . . . . . . . . . 14 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝐵 ⊆ (𝐴 / 𝑅))
1615, 10sseldd 3959 . . . . . . . . . . . . 13 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑏 ∈ (𝐴 / 𝑅))
17 simp1r 1199 . . . . . . . . . . . . . 14 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝐶 ⊆ (𝐴 / 𝑅))
18 simp2r 1201 . . . . . . . . . . . . . 14 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑐𝐶)
1917, 18sseldd 3959 . . . . . . . . . . . . 13 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑐 ∈ (𝐴 / 𝑅))
2014, 16, 19qsdisj 8808 . . . . . . . . . . . 12 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → (𝑏 = 𝑐 ∨ (𝑏𝑐) = ∅))
2120ord 864 . . . . . . . . . . 11 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → (¬ 𝑏 = 𝑐 → (𝑏𝑐) = ∅))
2221necon1ad 2949 . . . . . . . . . 10 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → ((𝑏𝑐) ≠ ∅ → 𝑏 = 𝑐))
2312, 22mpd 15 . . . . . . . . 9 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑏 = 𝑐)
2423, 18eqeltrd 2834 . . . . . . . 8 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑏𝐶)
2510, 24elind 4175 . . . . . . 7 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑏 ∈ (𝐵𝐶))
26 elunii 4888 . . . . . . 7 ((𝑥𝑏𝑏 ∈ (𝐵𝐶)) → 𝑥 (𝐵𝐶))
279, 25, 26syl2anc 584 . . . . . 6 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶) ∧ (𝑥𝑏𝑥𝑐)) → 𝑥 (𝐵𝐶))
28273expia 1121 . . . . 5 (((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) ∧ (𝑏𝐵𝑐𝐶)) → ((𝑥𝑏𝑥𝑐) → 𝑥 (𝐵𝐶)))
2928rexlimdvva 3198 . . . 4 ((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) → (∃𝑏𝐵𝑐𝐶 (𝑥𝑏𝑥𝑐) → 𝑥 (𝐵𝐶)))
308, 29biimtrid 242 . . 3 ((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) → (𝑥 ∈ ( 𝐵 𝐶) → 𝑥 (𝐵𝐶)))
3130ssrdv 3964 . 2 ((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) → ( 𝐵 𝐶) ⊆ (𝐵𝐶))
322, 31eqssd 3976 1 ((𝐵 ⊆ (𝐴 / 𝑅) ∧ 𝐶 ⊆ (𝐴 / 𝑅)) → (𝐵𝐶) = ( 𝐵 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2108  wne 2932  wrex 3060  cin 3925  wss 3926  c0 4308   cuni 4883   Er wer 8716   / cqs 8718
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-er 8719  df-ec 8721  df-qs 8725
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator