Theorem otsndisj 5519

Description: The singletons consisting of ordered triples which have distinct third components are disjoint. (Contributed by Alexander van der Vekens, 10-Mar-2018.)

Assertion

Ref	Expression
otsndisj	⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → Disj 𝑐 ∈ 𝑉 {⟨𝐴, 𝐵, 𝑐⟩})

Distinct variable groups:   𝐴,𝑐   𝐵,𝑐   𝑉,𝑐   𝑋,𝑐   𝑌,𝑐

Proof of Theorem otsndisj

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		otthg 5485	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝑐 ∈ 𝑉) → (⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩ ↔ (𝐴 = 𝐴 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑑)))
2	1	3expa 1118	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → (⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩ ↔ (𝐴 = 𝐴 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑑)))
3		simp3 1138	. . . . . . . . . . 11 ⊢ ((𝐴 = 𝐴 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑑) → 𝑐 = 𝑑)
4	2, 3	syl6bi 252	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → (⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩ → 𝑐 = 𝑑))
5	4	con3rr3 155	. . . . . . . . 9 ⊢ (¬ 𝑐 = 𝑑 → (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → ¬ ⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩))
6	5	imp 407	. . . . . . . 8 ⊢ ((¬ 𝑐 = 𝑑 ∧ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉)) → ¬ ⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩)
7	6	neqned 2947	. . . . . . 7 ⊢ ((¬ 𝑐 = 𝑑 ∧ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉)) → ⟨𝐴, 𝐵, 𝑐⟩ ≠ ⟨𝐴, 𝐵, 𝑑⟩)
8		disjsn2 4716	. . . . . . 7 ⊢ (⟨𝐴, 𝐵, 𝑐⟩ ≠ ⟨𝐴, 𝐵, 𝑑⟩ → ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅)
9	7, 8	syl 17	. . . . . 6 ⊢ ((¬ 𝑐 = 𝑑 ∧ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉)) → ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅)
10	9	expcom 414	. . . . 5 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → (¬ 𝑐 = 𝑑 → ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
11	10	orrd 861	. . . 4 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → (𝑐 = 𝑑 ∨ ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
12	11	adantrr 715	. . 3 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑐 = 𝑑 ∨ ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
13	12	ralrimivva 3200	. 2 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → ∀𝑐 ∈ 𝑉 ∀𝑑 ∈ 𝑉 (𝑐 = 𝑑 ∨ ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
14		oteq3 4884	. . . 4 ⊢ (𝑐 = 𝑑 → ⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩)
15	14	sneqd 4640	. . 3 ⊢ (𝑐 = 𝑑 → {⟨𝐴, 𝐵, 𝑐⟩} = {⟨𝐴, 𝐵, 𝑑⟩})
16	15	disjor 5128	. 2 ⊢ (Disj 𝑐 ∈ 𝑉 {⟨𝐴, 𝐵, 𝑐⟩} ↔ ∀𝑐 ∈ 𝑉 ∀𝑑 ∈ 𝑉 (𝑐 = 𝑑 ∨ ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
17	13, 16	sylibr 233	1 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → Disj 𝑐 ∈ 𝑉 {⟨𝐴, 𝐵, 𝑐⟩})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106   ≠ wne 2940  ∀wral 3061   ∩ cin 3947  ∅c0 4322  {csn 4628  ⟨cotp 4636  Disj wdisj 5113

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-11 2154  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-mo 2534  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rmo 3376  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-ot 4637  df-disj 5114

This theorem is referenced by: (None)