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

Theorem otiunsndisj 5413
Description: The union of singletons consisting of ordered triples which have distinct first and third components are disjoint. (Contributed by Alexander van der Vekens, 10-Mar-2018.)
Assertion
Ref Expression
otiunsndisj (𝐵𝑋Disj 𝑎𝑉 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩})
Distinct variable groups:   𝐵,𝑎,𝑐   𝑉,𝑎,𝑐   𝑊,𝑎,𝑐   𝑋,𝑎,𝑐

Proof of Theorem otiunsndisj
Dummy variables 𝑑 𝑒 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eliun 4926 . . . . . . . . . 10 (𝑠 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ↔ ∃𝑐 ∈ (𝑊 ∖ {𝑎})𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩})
2 otthg 5380 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑎𝑉𝐵𝑋𝑐 ∈ (𝑊 ∖ {𝑎})) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ ↔ (𝑎 = 𝑑𝐵 = 𝐵𝑐 = 𝑒)))
3 simp1 1132 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑎 = 𝑑𝐵 = 𝐵𝑐 = 𝑒) → 𝑎 = 𝑑)
42, 3syl6bi 255 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑎𝑉𝐵𝑋𝑐 ∈ (𝑊 ∖ {𝑎})) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ → 𝑎 = 𝑑))
54con3d 155 . . . . . . . . . . . . . . . . . . . . 21 ((𝑎𝑉𝐵𝑋𝑐 ∈ (𝑊 ∖ {𝑎})) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
653exp 1115 . . . . . . . . . . . . . . . . . . . 20 (𝑎𝑉 → (𝐵𝑋 → (𝑐 ∈ (𝑊 ∖ {𝑎}) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))))
76impcom 410 . . . . . . . . . . . . . . . . . . 19 ((𝐵𝑋𝑎𝑉) → (𝑐 ∈ (𝑊 ∖ {𝑎}) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)))
87com3r 87 . . . . . . . . . . . . . . . . . 18 𝑎 = 𝑑 → ((𝐵𝑋𝑎𝑉) → (𝑐 ∈ (𝑊 ∖ {𝑎}) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)))
98imp31 420 . . . . . . . . . . . . . . . . 17 (((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) ∧ 𝑐 ∈ (𝑊 ∖ {𝑎})) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
10 velsn 4586 . . . . . . . . . . . . . . . . . 18 (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} ↔ 𝑠 = ⟨𝑎, 𝐵, 𝑐⟩)
11 eqeq1 2828 . . . . . . . . . . . . . . . . . . 19 (𝑠 = ⟨𝑎, 𝐵, 𝑐⟩ → (𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
1211notbid 320 . . . . . . . . . . . . . . . . . 18 (𝑠 = ⟨𝑎, 𝐵, 𝑐⟩ → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
1310, 12sylbi 219 . . . . . . . . . . . . . . . . 17 (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
149, 13syl5ibrcom 249 . . . . . . . . . . . . . . . 16 (((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) ∧ 𝑐 ∈ (𝑊 ∖ {𝑎})) → (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩))
1514imp 409 . . . . . . . . . . . . . . 15 ((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) ∧ 𝑐 ∈ (𝑊 ∖ {𝑎})) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩)
16 velsn 4586 . . . . . . . . . . . . . . 15 (𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩} ↔ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩)
1715, 16sylnibr 331 . . . . . . . . . . . . . 14 ((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) ∧ 𝑐 ∈ (𝑊 ∖ {𝑎})) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
1817adantr 483 . . . . . . . . . . . . 13 (((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) ∧ 𝑐 ∈ (𝑊 ∖ {𝑎})) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ (𝑊 ∖ {𝑑})) → ¬ 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
1918nrexdv 3273 . . . . . . . . . . . 12 ((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) ∧ 𝑐 ∈ (𝑊 ∖ {𝑎})) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ ∃𝑒 ∈ (𝑊 ∖ {𝑑})𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
20 eliun 4926 . . . . . . . . . . . 12 (𝑠 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩} ↔ ∃𝑒 ∈ (𝑊 ∖ {𝑑})𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
2119, 20sylnibr 331 . . . . . . . . . . 11 ((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) ∧ 𝑐 ∈ (𝑊 ∖ {𝑎})) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ 𝑠 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩})
2221rexlimdva2 3290 . . . . . . . . . 10 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) → (∃𝑐 ∈ (𝑊 ∖ {𝑎})𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩}))
231, 22syl5bi 244 . . . . . . . . 9 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) → (𝑠 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩}))
2423ralrimiv 3184 . . . . . . . 8 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) → ∀𝑠 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩})
25 oteq3 4817 . . . . . . . . . . . . 13 (𝑐 = 𝑒 → ⟨𝑑, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
2625sneqd 4582 . . . . . . . . . . . 12 (𝑐 = 𝑒 → {⟨𝑑, 𝐵, 𝑐⟩} = {⟨𝑑, 𝐵, 𝑒⟩})
2726cbviunv 4968 . . . . . . . . . . 11 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩} = 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩}
2827eleq2i 2907 . . . . . . . . . 10 (𝑠 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩} ↔ 𝑠 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩})
2928notbii 322 . . . . . . . . 9 𝑠 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩} ↔ ¬ 𝑠 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩})
3029ralbii 3168 . . . . . . . 8 (∀𝑠 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩} ↔ ∀𝑠 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑒 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑒⟩})
3124, 30sylibr 236 . . . . . . 7 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) → ∀𝑠 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩})
32 disj 4402 . . . . . . 7 (( 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩}) = ∅ ↔ ∀𝑠 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩})
3331, 32sylibr 236 . . . . . 6 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋𝑎𝑉)) → ( 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩}) = ∅)
3433expcom 416 . . . . 5 ((𝐵𝑋𝑎𝑉) → (¬ 𝑎 = 𝑑 → ( 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
3534orrd 859 . . . 4 ((𝐵𝑋𝑎𝑉) → (𝑎 = 𝑑 ∨ ( 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
3635adantrr 715 . . 3 ((𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉)) → (𝑎 = 𝑑 ∨ ( 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
3736ralrimivva 3194 . 2 (𝐵𝑋 → ∀𝑎𝑉𝑑𝑉 (𝑎 = 𝑑 ∨ ( 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
38 sneq 4580 . . . 4 (𝑎 = 𝑑 → {𝑎} = {𝑑})
3938difeq2d 4102 . . 3 (𝑎 = 𝑑 → (𝑊 ∖ {𝑎}) = (𝑊 ∖ {𝑑}))
40 oteq1 4815 . . . 4 (𝑎 = 𝑑 → ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑐⟩)
4140sneqd 4582 . . 3 (𝑎 = 𝑑 → {⟨𝑎, 𝐵, 𝑐⟩} = {⟨𝑑, 𝐵, 𝑐⟩})
4239, 41disjiunb 5058 . 2 (Disj 𝑎𝑉 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ↔ ∀𝑎𝑉𝑑𝑉 (𝑎 = 𝑑 ∨ ( 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐 ∈ (𝑊 ∖ {𝑑}){⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
4337, 42sylibr 236 1 (𝐵𝑋Disj 𝑎𝑉 𝑐 ∈ (𝑊 ∖ {𝑎}){⟨𝑎, 𝐵, 𝑐⟩})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843  w3a 1083   = wceq 1536  wcel 2113  wral 3141  wrex 3142  cdif 3936  cin 3938  c0 4294  {csn 4570  cotp 4578   ciun 4922  Disj wdisj 5034
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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rex 3147  df-rmo 3149  df-rab 3150  df-v 3499  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-sn 4571  df-pr 4573  df-op 4577  df-ot 4579  df-iun 4924  df-disj 5035
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator