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

Theorem disjiund 4799
Description: Conditions for a collection of index unions of sets 𝐴(𝑎, 𝑏) for 𝑎𝑉 and 𝑏𝑊 to be disjoint. (Contributed by AV, 9-Jan-2022.)
Hypotheses
Ref Expression
disjiund.1 (𝑎 = 𝑐𝐴 = 𝐶)
disjiund.2 (𝑏 = 𝑑𝐶 = 𝐷)
disjiund.3 (𝑎 = 𝑐𝑊 = 𝑋)
disjiund.4 ((𝜑𝑥𝐴𝑥𝐷) → 𝑎 = 𝑐)
Assertion
Ref Expression
disjiund (𝜑Disj 𝑎𝑉 𝑏𝑊 𝐴)
Distinct variable groups:   𝐴,𝑐,𝑑,𝑥   𝐶,𝑎,𝑑,𝑥   𝐷,𝑏   𝑉,𝑎,𝑐   𝑊,𝑏,𝑐,𝑑,𝑥   𝑋,𝑎,𝑏,𝑑,𝑥   𝜑,𝑎,𝑏,𝑐,𝑑,𝑥
Allowed substitution hints:   𝐴(𝑎,𝑏)   𝐶(𝑏,𝑐)   𝐷(𝑥,𝑎,𝑐,𝑑)   𝑉(𝑥,𝑏,𝑑)   𝑊(𝑎)   𝑋(𝑐)

Proof of Theorem disjiund
StepHypRef Expression
1 eliun 4679 . . . . . . . . 9 (𝑥 𝑏𝑊 𝐴 ↔ ∃𝑏𝑊 𝑥𝐴)
2 eliun 4679 . . . . . . . . . . . 12 (𝑥 𝑏𝑋 𝐶 ↔ ∃𝑏𝑋 𝑥𝐶)
3 disjiund.2 . . . . . . . . . . . . . . 15 (𝑏 = 𝑑𝐶 = 𝐷)
43eleq2d 2829 . . . . . . . . . . . . . 14 (𝑏 = 𝑑 → (𝑥𝐶𝑥𝐷))
54cbvrexv 3319 . . . . . . . . . . . . 13 (∃𝑏𝑋 𝑥𝐶 ↔ ∃𝑑𝑋 𝑥𝐷)
6 disjiund.4 . . . . . . . . . . . . . . . . 17 ((𝜑𝑥𝐴𝑥𝐷) → 𝑎 = 𝑐)
763exp 1148 . . . . . . . . . . . . . . . 16 (𝜑 → (𝑥𝐴 → (𝑥𝐷𝑎 = 𝑐)))
87rexlimdvw 3180 . . . . . . . . . . . . . . 15 (𝜑 → (∃𝑏𝑊 𝑥𝐴 → (𝑥𝐷𝑎 = 𝑐)))
98imp 395 . . . . . . . . . . . . . 14 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (𝑥𝐷𝑎 = 𝑐))
109rexlimdvw 3180 . . . . . . . . . . . . 13 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (∃𝑑𝑋 𝑥𝐷𝑎 = 𝑐))
115, 10syl5bi 233 . . . . . . . . . . . 12 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (∃𝑏𝑋 𝑥𝐶𝑎 = 𝑐))
122, 11syl5bi 233 . . . . . . . . . . 11 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (𝑥 𝑏𝑋 𝐶𝑎 = 𝑐))
1312con3d 149 . . . . . . . . . 10 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (¬ 𝑎 = 𝑐 → ¬ 𝑥 𝑏𝑋 𝐶))
1413impancom 443 . . . . . . . . 9 ((𝜑 ∧ ¬ 𝑎 = 𝑐) → (∃𝑏𝑊 𝑥𝐴 → ¬ 𝑥 𝑏𝑋 𝐶))
151, 14syl5bi 233 . . . . . . . 8 ((𝜑 ∧ ¬ 𝑎 = 𝑐) → (𝑥 𝑏𝑊 𝐴 → ¬ 𝑥 𝑏𝑋 𝐶))
1615ralrimiv 3111 . . . . . . 7 ((𝜑 ∧ ¬ 𝑎 = 𝑐) → ∀𝑥 𝑏𝑊 𝐴 ¬ 𝑥 𝑏𝑋 𝐶)
17 disj 4177 . . . . . . 7 (( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅ ↔ ∀𝑥 𝑏𝑊 𝐴 ¬ 𝑥 𝑏𝑋 𝐶)
1816, 17sylibr 225 . . . . . 6 ((𝜑 ∧ ¬ 𝑎 = 𝑐) → ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅)
1918ex 401 . . . . 5 (𝜑 → (¬ 𝑎 = 𝑐 → ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅))
2019orrd 889 . . . 4 (𝜑 → (𝑎 = 𝑐 ∨ ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅))
2120a1d 25 . . 3 (𝜑 → ((𝑎𝑉𝑐𝑉) → (𝑎 = 𝑐 ∨ ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅)))
2221ralrimivv 3116 . 2 (𝜑 → ∀𝑎𝑉𝑐𝑉 (𝑎 = 𝑐 ∨ ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅))
23 disjiund.3 . . 3 (𝑎 = 𝑐𝑊 = 𝑋)
24 disjiund.1 . . 3 (𝑎 = 𝑐𝐴 = 𝐶)
2523, 24disjiunb 4798 . 2 (Disj 𝑎𝑉 𝑏𝑊 𝐴 ↔ ∀𝑎𝑉𝑐𝑉 (𝑎 = 𝑐 ∨ ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅))
2622, 25sylibr 225 1 (𝜑Disj 𝑎𝑉 𝑏𝑊 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384  wo 873  w3a 1107   = wceq 1652  wcel 2155  wral 3054  wrex 3055  cin 3730  c0 4078   ciun 4675  Disj wdisj 4776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2069  ax-7 2105  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2349  ax-ext 2742
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2062  df-mo 2564  df-clab 2751  df-cleq 2757  df-clel 2760  df-nfc 2895  df-ral 3059  df-rex 3060  df-rmo 3062  df-v 3351  df-dif 3734  df-in 3738  df-ss 3745  df-nul 4079  df-iun 4677  df-disj 4777
This theorem is referenced by:  2wspiundisj  27167
  Copyright terms: Public domain W3C validator