Theorem otsndisj 5504

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 5469	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝑐 ∈ 𝑉) → (⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩ ↔ (𝐴 = 𝐴 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑑)))
2	1	3expa 1136	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → (⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩ ↔ (𝐴 = 𝐴 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑑)))
3		simp3 1156	. . . . . . . . . . 11 ⊢ ((𝐴 = 𝐴 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑑) → 𝑐 = 𝑑)
4	2, 3	biimtrdi 256	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → (⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩ → 𝑐 = 𝑑))
5	4	con3rr3 156	. . . . . . . . 9 ⊢ (¬ 𝑐 = 𝑑 → (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → ¬ ⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩))
6	5	imp 412	. . . . . . . 8 ⊢ ((¬ 𝑐 = 𝑑 ∧ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉)) → ¬ ⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩)
7	6	neqned 2967	. . . . . . 7 ⊢ ((¬ 𝑐 = 𝑑 ∧ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉)) → ⟨𝐴, 𝐵, 𝑐⟩ ≠ ⟨𝐴, 𝐵, 𝑑⟩)
8		disjsn2 4680	. . . . . . 7 ⊢ (⟨𝐴, 𝐵, 𝑐⟩ ≠ ⟨𝐴, 𝐵, 𝑑⟩ → ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅)
9	7, 8	syl 18	. . . . . 6 ⊢ ((¬ 𝑐 = 𝑑 ∧ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉)) → ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅)
10	9	expcom 419	. . . . 5 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → (¬ 𝑐 = 𝑑 → ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
11	10	orrd 877	. . . 4 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ 𝑐 ∈ 𝑉) → (𝑐 = 𝑑 ∨ ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
12	11	adantrr 730	. . 3 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑐 = 𝑑 ∨ ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
13	12	ralrimivva 3210	. 2 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → ∀𝑐 ∈ 𝑉 ∀𝑑 ∈ 𝑉 (𝑐 = 𝑑 ∨ ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
14		oteq3 4851	. . . 4 ⊢ (𝑐 = 𝑑 → ⟨𝐴, 𝐵, 𝑐⟩ = ⟨𝐴, 𝐵, 𝑑⟩)
15	14	sneqd 4603	. . 3 ⊢ (𝑐 = 𝑑 → {⟨𝐴, 𝐵, 𝑐⟩} = {⟨𝐴, 𝐵, 𝑑⟩})
16	15	disjor 5093	. 2 ⊢ (Disj 𝑐 ∈ 𝑉 {⟨𝐴, 𝐵, 𝑐⟩} ↔ ∀𝑐 ∈ 𝑉 ∀𝑑 ∈ 𝑉 (𝑐 = 𝑑 ∨ ({⟨𝐴, 𝐵, 𝑐⟩} ∩ {⟨𝐴, 𝐵, 𝑑⟩}) = ∅))
17	13, 16	sylibr 237	1 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → Disj 𝑐 ∈ 𝑉 {⟨𝐴, 𝐵, 𝑐⟩})

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ∀wral 3081   ∩ cin 3905  ∅c0 4286  {csn 4591  ⟨cotp 4599  Disj wdisj 5078

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-11 2195  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2569  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rmo 3371  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-ot 4600  df-disj 5079

This theorem is used by: (None)