Theorem 2wspmdisj 30425

Description: The sets of paths of length 2 with a given vertex in the middle are distinct for different vertices in the middle. (Contributed by Alexander van der Vekens, 11-Mar-2018.) (Revised by AV, 18-May-2021.) (Proof shortened by AV, 10-Jan-2022.)

Hypotheses

Ref	Expression
frgrhash2wsp.v	⊢ 𝑉 = (Vtx‘𝐺)
fusgreg2wsp.m	⊢ 𝑀 = (𝑎 ∈ 𝑉 ↦ {𝑤 ∈ (2 WSPathsN 𝐺) ∣ (𝑤‘1) = 𝑎})

Assertion

Ref	Expression
2wspmdisj	⊢ Disj 𝑥 ∈ 𝑉 (𝑀‘𝑥)

Distinct variable groups:   𝐺,𝑎   𝑉,𝑎   𝑤,𝐺,𝑎,𝑥   𝑥,𝑉,𝑎,𝑤   𝑥,𝑀   𝑤,𝑉

Allowed substitution hints:   𝑀(𝑤,𝑎)

Proof of Theorem 2wspmdisj

Dummy variables 𝑦 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		orc 873	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑦 ∨ ((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅))
2	1	a1d 25	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 = 𝑦 ∨ ((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅)))
3		frgrhash2wsp.v	. . . . . . . . . . . . . 14 ⊢ 𝑉 = (Vtx‘𝐺)
4		fusgreg2wsp.m	. . . . . . . . . . . . . 14 ⊢ 𝑀 = (𝑎 ∈ 𝑉 ↦ {𝑤 ∈ (2 WSPathsN 𝐺) ∣ (𝑤‘1) = 𝑎})
5	3, 4	fusgreg2wsplem 30421	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝑉 → (𝑡 ∈ (𝑀‘𝑦) ↔ (𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦)))
6	5	adantl 482	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑡 ∈ (𝑀‘𝑦) ↔ (𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦)))
7	6	adantr 481	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ 𝑡 ∈ (𝑀‘𝑥)) → (𝑡 ∈ (𝑀‘𝑦) ↔ (𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦)))
8	3, 4	fusgreg2wsplem 30421	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑉 → (𝑡 ∈ (𝑀‘𝑥) ↔ (𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑥)))
9		eqtr2 2760	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑡‘1) = 𝑥 ∧ (𝑡‘1) = 𝑦) → 𝑥 = 𝑦)
10	9	expcom 414	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑡‘1) = 𝑦 → ((𝑡‘1) = 𝑥 → 𝑥 = 𝑦))
11	10	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦) → ((𝑡‘1) = 𝑥 → 𝑥 = 𝑦))
12	11	com12 32	. . . . . . . . . . . . . . 15 ⊢ ((𝑡‘1) = 𝑥 → ((𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦) → 𝑥 = 𝑦))
13	12	adantl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑥) → ((𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦) → 𝑥 = 𝑦))
14	8, 13	biimtrdi 254	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑉 → (𝑡 ∈ (𝑀‘𝑥) → ((𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦) → 𝑥 = 𝑦)))
15	14	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑡 ∈ (𝑀‘𝑥) → ((𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦) → 𝑥 = 𝑦)))
16	15	imp 407	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ 𝑡 ∈ (𝑀‘𝑥)) → ((𝑡 ∈ (2 WSPathsN 𝐺) ∧ (𝑡‘1) = 𝑦) → 𝑥 = 𝑦))
17	7, 16	sylbid 241	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ 𝑡 ∈ (𝑀‘𝑥)) → (𝑡 ∈ (𝑀‘𝑦) → 𝑥 = 𝑦))
18	17	con3d 152	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ 𝑡 ∈ (𝑀‘𝑥)) → (¬ 𝑥 = 𝑦 → ¬ 𝑡 ∈ (𝑀‘𝑦)))
19	18	impancom 452	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ ¬ 𝑥 = 𝑦) → (𝑡 ∈ (𝑀‘𝑥) → ¬ 𝑡 ∈ (𝑀‘𝑦)))
20	19	ralrimiv 3130	. . . . . . 7 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ ¬ 𝑥 = 𝑦) → ∀𝑡 ∈ (𝑀‘𝑥) ¬ 𝑡 ∈ (𝑀‘𝑦))
21		disj 4378	. . . . . . 7 ⊢ (((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅ ↔ ∀𝑡 ∈ (𝑀‘𝑥) ¬ 𝑡 ∈ (𝑀‘𝑦))
22	20, 21	sylibr 235	. . . . . 6 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ ¬ 𝑥 = 𝑦) → ((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅)
23	22	olcd 880	. . . . 5 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ ¬ 𝑥 = 𝑦) → (𝑥 = 𝑦 ∨ ((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅))
24	23	expcom 414	. . . 4 ⊢ (¬ 𝑥 = 𝑦 → ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 = 𝑦 ∨ ((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅)))
25	2, 24	pm2.61i 183	. . 3 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 = 𝑦 ∨ ((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅))
26	25	rgen2 3179	. 2 ⊢ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥 = 𝑦 ∨ ((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅)
27		fveq2 6827	. . 3 ⊢ (𝑥 = 𝑦 → (𝑀‘𝑥) = (𝑀‘𝑦))
28	27	disjor 5054	. 2 ⊢ (Disj 𝑥 ∈ 𝑉 (𝑀‘𝑥) ↔ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (𝑥 = 𝑦 ∨ ((𝑀‘𝑥) ∩ (𝑀‘𝑦)) = ∅))
29	26, 28	mpbir 232	1 ⊢ Disj 𝑥 ∈ 𝑉 (𝑀‘𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   ∨ wo 853   = wceq 1547   ∈ wcel 2119  ∀wral 3053  {crab 3391   ∩ cin 3882  ∅c0 4261  Disj wdisj 5039   ↦ cmpt 5153  ‘cfv 6485  (class class class)co 7356  1c1 11030  2c2 12227  Vtxcvtx 29083   WSPathsN cwwspthsn 29914

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-disj 5040  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-iota 6441  df-fun 6487  df-fv 6493  df-ov 7359

This theorem is referenced by:  fusgreghash2wsp  30426