Theorem otiunsndisjX 45973

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 865	. . . . 5 ⊢ (𝑎 = 𝑑 → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
2	1	a1d 25	. . . 4 ⊢ (𝑎 = 𝑑 → ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)))
3		eliun 5000	. . . . . . . . . 10 ⊢ (𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ↔ ∃𝑐 ∈ 𝑊 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩})
4		simprl 769	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → 𝑎 ∈ 𝑉)
5	4	adantl 482	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → 𝑎 ∈ 𝑉)
6		simprl 769	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → 𝐵 ∈ 𝑋)
7		simpl 483	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → 𝑐 ∈ 𝑊)
8		otthg 5484	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝐵 ∈ 𝑋 ∧ 𝑐 ∈ 𝑊) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ ↔ (𝑎 = 𝑑 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑒)))
9	5, 6, 7, 8	syl3anc 1371	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ ↔ (𝑎 = 𝑑 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑒)))
10		simp1 1136	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎 = 𝑑 ∧ 𝐵 = 𝐵 ∧ 𝑐 = 𝑒) → 𝑎 = 𝑑)
11	9, 10	syl6bi 252	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩ → 𝑎 = 𝑑))
12	11	con3d 152	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑐 ∈ 𝑊 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
13	12	ex 413	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑐 ∈ 𝑊 → ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (¬ 𝑎 = 𝑑 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)))
14	13	com13 88	. . . . . . . . . . . . . . . . . 18 ⊢ (¬ 𝑎 = 𝑑 → ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑐 ∈ 𝑊 → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)))
15	14	imp31 418	. . . . . . . . . . . . . . . . 17 ⊢ (((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
16	15	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
17	16	adantr 481	. . . . . . . . . . . . . . 15 ⊢ (((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ 𝑊) → ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
18		velsn 4643	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} ↔ 𝑠 = ⟨𝑎, 𝐵, 𝑐⟩)
19		eqeq1 2736	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑠 = ⟨𝑎, 𝐵, 𝑐⟩ → (𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
20	19	notbid 317	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 = ⟨𝑎, 𝐵, 𝑐⟩ → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
21	18, 20	sylbi 216	. . . . . . . . . . . . . . . . 17 ⊢ (𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
22	21	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ ((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
23	22	adantr 481	. . . . . . . . . . . . . . 15 ⊢ (((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ 𝑊) → (¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩ ↔ ¬ ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩))
24	17, 23	mpbird 256	. . . . . . . . . . . . . 14 ⊢ (((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ 𝑊) → ¬ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩)
25		velsn 4643	. . . . . . . . . . . . . 14 ⊢ (𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩} ↔ 𝑠 = ⟨𝑑, 𝐵, 𝑒⟩)
26	24, 25	sylnibr 328	. . . . . . . . . . . . 13 ⊢ (((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) ∧ 𝑒 ∈ 𝑊) → ¬ 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
27	26	nrexdv 3149	. . . . . . . . . . . 12 ⊢ ((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ ∃𝑒 ∈ 𝑊 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
28		eliun 5000	. . . . . . . . . . . 12 ⊢ (𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩} ↔ ∃𝑒 ∈ 𝑊 𝑠 ∈ {⟨𝑑, 𝐵, 𝑒⟩})
29	27, 28	sylnibr 328	. . . . . . . . . . 11 ⊢ ((((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) ∧ 𝑐 ∈ 𝑊) ∧ 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩}) → ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
30	29	rexlimdva2 3157	. . . . . . . . . 10 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (∃𝑐 ∈ 𝑊 𝑠 ∈ {⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩}))
31	3, 30	biimtrid 241	. . . . . . . . 9 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} → ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩}))
32	31	ralrimiv 3145	. . . . . . . 8 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → ∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
33		oteq3 4883	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑒 → ⟨𝑑, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑒⟩)
34	33	sneqd 4639	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝑒 → {⟨𝑑, 𝐵, 𝑐⟩} = {⟨𝑑, 𝐵, 𝑒⟩})
35	34	cbviunv 5042	. . . . . . . . . . 11 ⊢ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩} = ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩}
36	35	eleq2i 2825	. . . . . . . . . 10 ⊢ (𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
37	36	notbii 319	. . . . . . . . 9 ⊢ (¬ 𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
38	37	ralbii 3093	. . . . . . . 8 ⊢ (∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩} ↔ ∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑒 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑒⟩})
39	32, 38	sylibr 233	. . . . . . 7 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → ∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
40		disj 4446	. . . . . . 7 ⊢ ((∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅ ↔ ∀𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ¬ 𝑠 ∈ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
41	39, 40	sylibr 233	. . . . . 6 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)
42	41	olcd 872	. . . . 5 ⊢ ((¬ 𝑎 = 𝑑 ∧ (𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))) → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
43	42	ex 413	. . . 4 ⊢ (¬ 𝑎 = 𝑑 → ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅)))
44	2, 43	pm2.61i 182	. . 3 ⊢ ((𝐵 ∈ 𝑋 ∧ (𝑎 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
45	44	ralrimivva 3200	. 2 ⊢ (𝐵 ∈ 𝑋 → ∀𝑎 ∈ 𝑉 ∀𝑑 ∈ 𝑉 (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
46		oteq1 4881	. . . . 5 ⊢ (𝑎 = 𝑑 → ⟨𝑎, 𝐵, 𝑐⟩ = ⟨𝑑, 𝐵, 𝑐⟩)
47	46	sneqd 4639	. . . 4 ⊢ (𝑎 = 𝑑 → {⟨𝑎, 𝐵, 𝑐⟩} = {⟨𝑑, 𝐵, 𝑐⟩})
48	47	iuneq2d 5025	. . 3 ⊢ (𝑎 = 𝑑 → ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} = ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩})
49	48	disjor 5127	. 2 ⊢ (Disj 𝑎 ∈ 𝑉 ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ↔ ∀𝑎 ∈ 𝑉 ∀𝑑 ∈ 𝑉 (𝑎 = 𝑑 ∨ (∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩} ∩ ∪ 𝑐 ∈ 𝑊 {⟨𝑑, 𝐵, 𝑐⟩}) = ∅))
50	45, 49	sylibr 233	1 ⊢ (𝐵 ∈ 𝑋 → Disj 𝑎 ∈ 𝑉 ∪ 𝑐 ∈ 𝑊 {⟨𝑎, 𝐵, 𝑐⟩})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3061  ∃wrex 3070   ∩ cin 3946  ∅c0 4321  {csn 4627  ⟨cotp 4635  ∪ ciun 4996  Disj wdisj 5112

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-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426

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-nf 1786  df-sb 2068  df-mo 2534  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ral 3062  df-rex 3071  df-rmo 3376  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-ot 4636  df-iun 4998  df-disj 5113

This theorem is referenced by: (None)