Theorem otiunsndisjX 43835

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.

Step	Hyp	Ref	Expression
1		orc 864	. . . . 5 ⊢ (𝑎 = 𝑑 → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
2	1	a1d 25	. . . 4 ⊢ (𝑎 = 𝑑 → ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)))
3		eliun 4885	. . . . . . . . . 10 ⊢ (𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ↔ ∃𝑐 ∈ 𝑊 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩})
4		simprl 770	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → 𝑎 ∈ 𝑉)
5	4	adantl 485	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → 𝑎 ∈ 𝑉)
6		simprl 770	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → 𝐵 ∈ 𝑋)
7		simpl 486	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → 𝑐 ∈ 𝑊)
8		otthg 5342	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝐵 ∈ 𝑋 ∧ 𝑐 ∈ 𝑊) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ ↔ (𝑎 = 𝑑 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑒)))
9	5, 6, 7, 8	syl3anc 1368	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ ↔ (𝑎 = 𝑑 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑒)))
10		simp1 1133	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎 = 𝑑 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑒) → 𝑎 = 𝑑)
11	9, 10	syl6bi 256	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ → 𝑎 = 𝑑))
12	11	con3d 155	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
13	12	ex 416	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑐 ∈ 𝑊 → ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)))
14	13	com13 88	. . . . . . . . . . . . . . . . . 18 ⊢ (¬ 𝑎 = 𝑑 → ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑐 ∈ 𝑊 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)))
15	14	imp31 421	. . . . . . . . . . . . . . . . 17 ⊢ (((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
16	15	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ ((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
17	16	adantr 484	. . . . . . . . . . . . . . 15 ⊢ (((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ 𝑊) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
18		velsn 4541	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} ↔ 𝑠 = ⟨𝑎, 𝐵, 𝑐⟩)
19		eqeq1 2802	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑠 = ⟨𝑎, 𝐵, 𝑐⟩ → (𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
20	19	notbid 321	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 = ⟨𝑎, 𝐵, 𝑐⟩ → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
21	18, 20	sylbi 220	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
22	21	adantl 485	. . . . . . . . . . . . . . . 16 ⊢ ((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
23	22	adantr 484	. . . . . . . . . . . . . . 15 ⊢ (((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ 𝑊) → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
24	17, 23	mpbird 260	. . . . . . . . . . . . . 14 ⊢ (((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ 𝑊) → ¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩)
25		velsn 4541	. . . . . . . . . . . . . 14 ⊢ (𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩} ↔ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩)
26	24, 25	sylnibr 332	. . . . . . . . . . . . 13 ⊢ (((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ 𝑊) → ¬ 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
27	26	nrexdv 3229	. . . . . . . . . . . 12 ⊢ ((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ ∃𝑒 ∈ 𝑊 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
28		eliun 4885	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩} ↔ ∃𝑒 ∈ 𝑊 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
29	27, 28	sylnibr 332	. . . . . . . . . . 11 ⊢ ((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
30	29	rexlimdva2 3246	. . . . . . . . . 10 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (∃𝑐 ∈ 𝑊 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩}))
31	3, 30	syl5bi 245	. . . . . . . . 9 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩}))
32	31	ralrimiv 3148	. . . . . . . 8 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → ∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
33		oteq3 4776	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑒 → ⟨𝑑, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
34	33	sneqd 4537	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝑒 → {⟨𝑑, 𝐵, 𝑐⟩} = {⟨𝑑, 𝐵, 𝑒⟩})
35	34	cbviunv 4927	. . . . . . . . . . 11 ⊢ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩} = ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩}
36	35	eleq2i 2881	. . . . . . . . . 10 ⊢ (𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
37	36	notbii 323	. . . . . . . . 9 ⊢ (¬ 𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
38	37	ralbii 3133	. . . . . . . 8 ⊢ (∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ ∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
39	32, 38	sylibr 237	. . . . . . 7 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → ∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
40		disj 4355	. . . . . . 7 ⊢ ((∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅ ↔ ∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
41	39, 40	sylibr 237	. . . . . 6 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)
42	41	olcd 871	. . . . 5 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
43	42	ex 416	. . . 4 ⊢ (¬ 𝑎 = 𝑑 → ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)))
44	2, 43	pm2.61i 185	. . 3 ⊢ ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
45	44	ralrimivva 3156	. 2 ⊢ (𝐵 ∈ 𝑋 → ∀𝑎 ∈ 𝑉 ∀𝑑 ∈ 𝑉 (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
46		oteq1 4774	. . . . 5 ⊢ (𝑎 = 𝑑 → ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑐⟩)
47	46	sneqd 4537	. . . 4 ⊢ (𝑎 = 𝑑 → {⟨𝑎, 𝐵, 𝑐⟩} = {⟨𝑑, 𝐵, 𝑐⟩})
48	47	iuneq2d 4910	. . 3 ⊢ (𝑎 = 𝑑 → ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} = ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
49	48	disjor 5010	. 2 ⊢ (Disj 𝑎 ∈ 𝑉 ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ↔ ∀𝑎 ∈ 𝑉 ∀𝑑 ∈ 𝑉 (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
50	45, 49	sylibr 237	1 ⊢ (𝐵 ∈ 𝑋 → Disj 𝑎 ∈ 𝑉 ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∨ wo 844   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3106  ∃wrex 3107   ∩ cin 3880  ∅c0 4243  {csn 4525  ⟨cotp 4533  ∪ ciun 4881  Disj wdisj 4995

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rmo 3114  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-ot 4534  df-iun 4883  df-disj 4996

This theorem is referenced by: (None)