Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  otiunsndisjX Structured version   Visualization version   GIF version

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

Proof of Theorem otiunsndisjX
Dummy variables 𝑑 𝑒 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 orc 863 . . . . 5 (𝑎 = 𝑑 → (𝑎 = 𝑑 ∨ ( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
21a1d 25 . . . 4 (𝑎 = 𝑑 → ((𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉)) → (𝑎 = 𝑑 ∨ ( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)))
3 eliun 4914 . . . . . . . . . 10 (𝑠 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ↔ ∃𝑐𝑊 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩})
4 simprl 769 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉)) → 𝑎𝑉)
54adantl 484 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑐𝑊 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → 𝑎𝑉)
6 simprl 769 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑐𝑊 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → 𝐵𝑋)
7 simpl 485 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑐𝑊 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → 𝑐𝑊)
8 otthg 5368 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑎𝑉𝐵𝑋𝑐𝑊) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ ↔ (𝑎 = 𝑑𝐵 = 𝐵𝑐 = 𝑒)))
95, 6, 7, 8syl3anc 1365 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑐𝑊 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ ↔ (𝑎 = 𝑑𝐵 = 𝐵𝑐 = 𝑒)))
10 simp1 1130 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑎 = 𝑑𝐵 = 𝐵𝑐 = 𝑒) → 𝑎 = 𝑑)
119, 10syl6bi 255 . . . . . . . . . . . . . . . . . . . . 21 ((𝑐𝑊 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ → 𝑎 = 𝑑))
1211con3d 155 . . . . . . . . . . . . . . . . . . . 20 ((𝑐𝑊 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
1312ex 415 . . . . . . . . . . . . . . . . . . 19 (𝑐𝑊 → ((𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉)) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)))
1413com13 88 . . . . . . . . . . . . . . . . . 18 𝑎 = 𝑑 → ((𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉)) → (𝑐𝑊 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)))
1514imp31 420 . . . . . . . . . . . . . . . . 17 (((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
1615adantr 483 . . . . . . . . . . . . . . . 16 ((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
1716adantr 483 . . . . . . . . . . . . . . 15 (((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒𝑊) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
18 velsn 4575 . . . . . . . . . . . . . . . . . 18 (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} ↔ 𝑠 = ⟨𝑎, 𝐵, 𝑐⟩)
19 eqeq1 2823 . . . . . . . . . . . . . . . . . . 19 (𝑠 = ⟨𝑎, 𝐵, 𝑐⟩ → (𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
2019notbid 320 . . . . . . . . . . . . . . . . . 18 (𝑠 = ⟨𝑎, 𝐵, 𝑐⟩ → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
2118, 20sylbi 219 . . . . . . . . . . . . . . . . 17 (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
2221adantl 484 . . . . . . . . . . . . . . . 16 ((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
2322adantr 483 . . . . . . . . . . . . . . 15 (((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒𝑊) → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
2417, 23mpbird 259 . . . . . . . . . . . . . 14 (((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒𝑊) → ¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩)
25 velsn 4575 . . . . . . . . . . . . . 14 (𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩} ↔ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩)
2624, 25sylnibr 331 . . . . . . . . . . . . 13 (((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒𝑊) → ¬ 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
2726nrexdv 3268 . . . . . . . . . . . 12 ((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ ∃𝑒𝑊 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
28 eliun 4914 . . . . . . . . . . . 12 (𝑠 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩} ↔ ∃𝑒𝑊 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
2927, 28sylnibr 331 . . . . . . . . . . 11 ((((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) ∧ 𝑐𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ 𝑠 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
3029rexlimdva2 3285 . . . . . . . . . 10 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → (∃𝑐𝑊 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩}))
313, 30syl5bi 244 . . . . . . . . 9 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → (𝑠 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩}))
3231ralrimiv 3179 . . . . . . . 8 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → ∀𝑠 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
33 oteq3 4806 . . . . . . . . . . . . 13 (𝑐 = 𝑒 → ⟨𝑑, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
3433sneqd 4571 . . . . . . . . . . . 12 (𝑐 = 𝑒 → {⟨𝑑, 𝐵, 𝑐⟩} = {⟨𝑑, 𝐵, 𝑒⟩})
3534cbviunv 4956 . . . . . . . . . . 11 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩} = 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩}
3635eleq2i 2902 . . . . . . . . . 10 (𝑠 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ 𝑠 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
3736notbii 322 . . . . . . . . 9 𝑠 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ ¬ 𝑠 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
3837ralbii 3163 . . . . . . . 8 (∀𝑠 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ ∀𝑠 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑒𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
3932, 38sylibr 236 . . . . . . 7 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → ∀𝑠 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
40 disj 4397 . . . . . . 7 (( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅ ↔ ∀𝑠 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
4139, 40sylibr 236 . . . . . 6 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → ( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)
4241olcd 872 . . . . 5 ((¬ 𝑎 = 𝑑 ∧ (𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉))) → (𝑎 = 𝑑 ∨ ( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
4342ex 415 . . . 4 𝑎 = 𝑑 → ((𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉)) → (𝑎 = 𝑑 ∨ ( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)))
442, 43pm2.61i 183 . . 3 ((𝐵𝑋 ∧ (𝑎𝑉𝑑𝑉)) → (𝑎 = 𝑑 ∨ ( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
4544ralrimivva 3189 . 2 (𝐵𝑋 → ∀𝑎𝑉𝑑𝑉 (𝑎 = 𝑑 ∨ ( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
46 oteq1 4804 . . . . 5 (𝑎 = 𝑑 → ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑐⟩)
4746sneqd 4571 . . . 4 (𝑎 = 𝑑 → {⟨𝑎, 𝐵, 𝑐⟩} = {⟨𝑑, 𝐵, 𝑐⟩})
4847iuneq2d 4939 . . 3 (𝑎 = 𝑑 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} = 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
4948disjor 5037 . 2 (Disj 𝑎𝑉 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ↔ ∀𝑎𝑉𝑑𝑉 (𝑎 = 𝑑 ∨ ( 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ 𝑐𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
5045, 49sylibr 236 1 (𝐵𝑋Disj 𝑎𝑉 𝑐𝑊 {⟨𝑎, 𝐵, 𝑐⟩})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843  w3a 1081   = wceq 1530  wcel 2107  wral 3136  wrex 3137  cin 3933  c0 4289  {csn 4559  cotp 4567   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  ax-sep 5194  ax-nul 5201  ax-pr 5320
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-rab 3145  df-v 3495  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-sn 4560  df-pr 4562  df-op 4566  df-ot 4568  df-iun 4912  df-disj 5023
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator