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

Theorem disjiund 5047
 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 4914 . . . . . . . . 9 (𝑥 𝑏𝑊 𝐴 ↔ ∃𝑏𝑊 𝑥𝐴)
2 eliun 4914 . . . . . . . . . . . 12 (𝑥 𝑏𝑋 𝐶 ↔ ∃𝑏𝑋 𝑥𝐶)
3 disjiund.2 . . . . . . . . . . . . . . 15 (𝑏 = 𝑑𝐶 = 𝐷)
43eleq2d 2896 . . . . . . . . . . . . . 14 (𝑏 = 𝑑 → (𝑥𝐶𝑥𝐷))
54cbvrexvw 3449 . . . . . . . . . . . . 13 (∃𝑏𝑋 𝑥𝐶 ↔ ∃𝑑𝑋 𝑥𝐷)
6 disjiund.4 . . . . . . . . . . . . . . . . 17 ((𝜑𝑥𝐴𝑥𝐷) → 𝑎 = 𝑐)
763exp 1113 . . . . . . . . . . . . . . . 16 (𝜑 → (𝑥𝐴 → (𝑥𝐷𝑎 = 𝑐)))
87rexlimdvw 3288 . . . . . . . . . . . . . . 15 (𝜑 → (∃𝑏𝑊 𝑥𝐴 → (𝑥𝐷𝑎 = 𝑐)))
98imp 409 . . . . . . . . . . . . . 14 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (𝑥𝐷𝑎 = 𝑐))
109rexlimdvw 3288 . . . . . . . . . . . . 13 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (∃𝑑𝑋 𝑥𝐷𝑎 = 𝑐))
115, 10syl5bi 244 . . . . . . . . . . . 12 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (∃𝑏𝑋 𝑥𝐶𝑎 = 𝑐))
122, 11syl5bi 244 . . . . . . . . . . 11 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (𝑥 𝑏𝑋 𝐶𝑎 = 𝑐))
1312con3d 155 . . . . . . . . . 10 ((𝜑 ∧ ∃𝑏𝑊 𝑥𝐴) → (¬ 𝑎 = 𝑐 → ¬ 𝑥 𝑏𝑋 𝐶))
1413impancom 454 . . . . . . . . 9 ((𝜑 ∧ ¬ 𝑎 = 𝑐) → (∃𝑏𝑊 𝑥𝐴 → ¬ 𝑥 𝑏𝑋 𝐶))
151, 14syl5bi 244 . . . . . . . 8 ((𝜑 ∧ ¬ 𝑎 = 𝑐) → (𝑥 𝑏𝑊 𝐴 → ¬ 𝑥 𝑏𝑋 𝐶))
1615ralrimiv 3179 . . . . . . 7 ((𝜑 ∧ ¬ 𝑎 = 𝑐) → ∀𝑥 𝑏𝑊 𝐴 ¬ 𝑥 𝑏𝑋 𝐶)
17 disj 4397 . . . . . . 7 (( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅ ↔ ∀𝑥 𝑏𝑊 𝐴 ¬ 𝑥 𝑏𝑋 𝐶)
1816, 17sylibr 236 . . . . . 6 ((𝜑 ∧ ¬ 𝑎 = 𝑐) → ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅)
1918ex 415 . . . . 5 (𝜑 → (¬ 𝑎 = 𝑐 → ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅))
2019orrd 859 . . . 4 (𝜑 → (𝑎 = 𝑐 ∨ ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅))
2120a1d 25 . . 3 (𝜑 → ((𝑎𝑉𝑐𝑉) → (𝑎 = 𝑐 ∨ ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅)))
2221ralrimivv 3188 . 2 (𝜑 → ∀𝑎𝑉𝑐𝑉 (𝑎 = 𝑐 ∨ ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅))
23 disjiund.3 . . 3 (𝑎 = 𝑐𝑊 = 𝑋)
24 disjiund.1 . . 3 (𝑎 = 𝑐𝐴 = 𝐶)
2523, 24disjiunb 5046 . 2 (Disj 𝑎𝑉 𝑏𝑊 𝐴 ↔ ∀𝑎𝑉𝑐𝑉 (𝑎 = 𝑐 ∨ ( 𝑏𝑊 𝐴 𝑏𝑋 𝐶) = ∅))
2622, 25sylibr 236 1 (𝜑Disj 𝑎𝑉 𝑏𝑊 𝐴)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   ∨ wo 843   ∧ w3a 1081   = wceq 1530   ∈ wcel 2107  ∀wral 3136  ∃wrex 3137   ∩ cin 3933  ∅c0 4289  ∪ ciun 4910  Disj wdisj 5022 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142  df-rmo 3144  df-v 3495  df-dif 3937  df-in 3941  df-ss 3950  df-nul 4290  df-iun 4912  df-disj 5023 This theorem is referenced by:  2wspiundisj  27734
 Copyright terms: Public domain W3C validator