Theorem isomuspgrlem2c 46142

Description: Lemma 3 for isomuspgrlem2 46145. (Contributed by AV, 29-Nov-2022.)

Hypotheses

Ref	Expression
isomushgr.v	⊢ 𝑉 = (Vtx‘𝐴)
isomushgr.w	⊢ 𝑊 = (Vtx‘𝐵)
isomushgr.e	⊢ 𝐸 = (Edg‘𝐴)
isomushgr.k	⊢ 𝐾 = (Edg‘𝐵)
isomuspgrlem2.g	⊢ 𝐺 = (𝑥 ∈ 𝐸 ↦ (𝐹 “ 𝑥))
isomuspgrlem2.a	⊢ (𝜑 → 𝐴 ∈ USPGraph)
isomuspgrlem2.f	⊢ (𝜑 → 𝐹:𝑉–1-1-onto→𝑊)
isomuspgrlem2.i	⊢ (𝜑 → ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝐹‘𝑎), (𝐹‘𝑏)} ∈ 𝐾))
isomuspgrlem2.x	⊢ (𝜑 → 𝐹 ∈ 𝑋)

Assertion

Ref	Expression
isomuspgrlem2c	⊢ (𝜑 → 𝐺:𝐸–1-1→𝐾)

Distinct variable groups:   𝑎,𝑏,𝑥   𝑥,𝐴   𝑥,𝐵   𝑥,𝐸   𝑥,𝐾   𝑥,𝑉   𝑥,𝑊   𝑥,𝐹   𝑥,𝑋   𝐸,𝑎,𝑏   𝐹,𝑎,𝑏   𝐾,𝑎,𝑏   𝑉,𝑎,𝑏   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑎,𝑏)   𝐴(𝑎,𝑏)   𝐵(𝑎,𝑏)   𝐺(𝑥,𝑎,𝑏)   𝑊(𝑎,𝑏)   𝑋(𝑎,𝑏)

Proof of Theorem isomuspgrlem2c

Dummy variables 𝑒 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isomushgr.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐴)
2		isomushgr.w	. . 3 ⊢ 𝑊 = (Vtx‘𝐵)
3		isomushgr.e	. . 3 ⊢ 𝐸 = (Edg‘𝐴)
4		isomushgr.k	. . 3 ⊢ 𝐾 = (Edg‘𝐵)
5		isomuspgrlem2.g	. . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐸 ↦ (𝐹 “ 𝑥))
6		isomuspgrlem2.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ USPGraph)
7		isomuspgrlem2.f	. . 3 ⊢ (𝜑 → 𝐹:𝑉–1-1-onto→𝑊)
8		isomuspgrlem2.i	. . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝑉 ∀𝑏 ∈ 𝑉 ({𝑎, 𝑏} ∈ 𝐸 ↔ {(𝐹‘𝑎), (𝐹‘𝑏)} ∈ 𝐾))
9	1, 2, 3, 4, 5, 6, 7, 8	isomuspgrlem2b 46141	. 2 ⊢ (𝜑 → 𝐺:𝐸⟶𝐾)
10		isomuspgrlem2.x	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ 𝑋)
11	1, 2, 3, 4, 5	isomuspgrlem2a 46140	. . . . . 6 ⊢ (𝐹 ∈ 𝑋 → ∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒))
12	10, 11	syl 17	. . . . 5 ⊢ (𝜑 → ∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒))
13		imaeq2 6014	. . . . . . . . . . 11 ⊢ (𝑒 = 𝑐 → (𝐹 “ 𝑒) = (𝐹 “ 𝑐))
14		fveq2 6847	. . . . . . . . . . 11 ⊢ (𝑒 = 𝑐 → (𝐺‘𝑒) = (𝐺‘𝑐))
15	13, 14	eqeq12d 2747	. . . . . . . . . 10 ⊢ (𝑒 = 𝑐 → ((𝐹 “ 𝑒) = (𝐺‘𝑒) ↔ (𝐹 “ 𝑐) = (𝐺‘𝑐)))
16	15	rspcv 3578	. . . . . . . . 9 ⊢ (𝑐 ∈ 𝐸 → (∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒) → (𝐹 “ 𝑐) = (𝐺‘𝑐)))
17	16	ad2antrl 726	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) → (∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒) → (𝐹 “ 𝑐) = (𝐺‘𝑐)))
18	17	imp 407	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) ∧ ∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒)) → (𝐹 “ 𝑐) = (𝐺‘𝑐))
19	18	eqcomd 2737	. . . . . 6 ⊢ (((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) ∧ ∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒)) → (𝐺‘𝑐) = (𝐹 “ 𝑐))
20		imaeq2 6014	. . . . . . . . . . 11 ⊢ (𝑒 = 𝑑 → (𝐹 “ 𝑒) = (𝐹 “ 𝑑))
21		fveq2 6847	. . . . . . . . . . 11 ⊢ (𝑒 = 𝑑 → (𝐺‘𝑒) = (𝐺‘𝑑))
22	20, 21	eqeq12d 2747	. . . . . . . . . 10 ⊢ (𝑒 = 𝑑 → ((𝐹 “ 𝑒) = (𝐺‘𝑒) ↔ (𝐹 “ 𝑑) = (𝐺‘𝑑)))
23	22	rspcv 3578	. . . . . . . . 9 ⊢ (𝑑 ∈ 𝐸 → (∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒) → (𝐹 “ 𝑑) = (𝐺‘𝑑)))
24	23	ad2antll 727	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) → (∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒) → (𝐹 “ 𝑑) = (𝐺‘𝑑)))
25	24	imp 407	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) ∧ ∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒)) → (𝐹 “ 𝑑) = (𝐺‘𝑑))
26	25	eqcomd 2737	. . . . . 6 ⊢ (((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) ∧ ∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒)) → (𝐺‘𝑑) = (𝐹 “ 𝑑))
27	19, 26	eqeq12d 2747	. . . . 5 ⊢ (((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) ∧ ∀𝑒 ∈ 𝐸 (𝐹 “ 𝑒) = (𝐺‘𝑒)) → ((𝐺‘𝑐) = (𝐺‘𝑑) ↔ (𝐹 “ 𝑐) = (𝐹 “ 𝑑)))
28	12, 27	mpidan 687	. . . 4 ⊢ ((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) → ((𝐺‘𝑐) = (𝐺‘𝑑) ↔ (𝐹 “ 𝑐) = (𝐹 “ 𝑑)))
29		f1of1 6788	. . . . . . 7 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹:𝑉–1-1→𝑊)
30	7, 29	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑉–1-1→𝑊)
31		uspgrupgr 28190	. . . . . . . 8 ⊢ (𝐴 ∈ USPGraph → 𝐴 ∈ UPGraph)
32		upgruhgr 28116	. . . . . . . . 9 ⊢ (𝐴 ∈ UPGraph → 𝐴 ∈ UHGraph)
33	3	eleq2i 2824	. . . . . . . . . . 11 ⊢ (𝑐 ∈ 𝐸 ↔ 𝑐 ∈ (Edg‘𝐴))
34		edguhgr 28143	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ UHGraph ∧ 𝑐 ∈ (Edg‘𝐴)) → 𝑐 ∈ 𝒫 (Vtx‘𝐴))
35		elpwi 4572	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ 𝒫 (Vtx‘𝐴) → 𝑐 ⊆ (Vtx‘𝐴))
36	35, 1	sseqtrrdi 3998	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ 𝒫 (Vtx‘𝐴) → 𝑐 ⊆ 𝑉)
37	34, 36	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ UHGraph ∧ 𝑐 ∈ (Edg‘𝐴)) → 𝑐 ⊆ 𝑉)
38	37	ex 413	. . . . . . . . . . 11 ⊢ (𝐴 ∈ UHGraph → (𝑐 ∈ (Edg‘𝐴) → 𝑐 ⊆ 𝑉))
39	33, 38	biimtrid 241	. . . . . . . . . 10 ⊢ (𝐴 ∈ UHGraph → (𝑐 ∈ 𝐸 → 𝑐 ⊆ 𝑉))
40	3	eleq2i 2824	. . . . . . . . . . 11 ⊢ (𝑑 ∈ 𝐸 ↔ 𝑑 ∈ (Edg‘𝐴))
41		edguhgr 28143	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ UHGraph ∧ 𝑑 ∈ (Edg‘𝐴)) → 𝑑 ∈ 𝒫 (Vtx‘𝐴))
42		elpwi 4572	. . . . . . . . . . . . . 14 ⊢ (𝑑 ∈ 𝒫 (Vtx‘𝐴) → 𝑑 ⊆ (Vtx‘𝐴))
43	42, 1	sseqtrrdi 3998	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ 𝒫 (Vtx‘𝐴) → 𝑑 ⊆ 𝑉)
44	41, 43	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ UHGraph ∧ 𝑑 ∈ (Edg‘𝐴)) → 𝑑 ⊆ 𝑉)
45	44	ex 413	. . . . . . . . . . 11 ⊢ (𝐴 ∈ UHGraph → (𝑑 ∈ (Edg‘𝐴) → 𝑑 ⊆ 𝑉))
46	40, 45	biimtrid 241	. . . . . . . . . 10 ⊢ (𝐴 ∈ UHGraph → (𝑑 ∈ 𝐸 → 𝑑 ⊆ 𝑉))
47	39, 46	anim12d 609	. . . . . . . . 9 ⊢ (𝐴 ∈ UHGraph → ((𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸) → (𝑐 ⊆ 𝑉 ∧ 𝑑 ⊆ 𝑉)))
48	32, 47	syl 17	. . . . . . . 8 ⊢ (𝐴 ∈ UPGraph → ((𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸) → (𝑐 ⊆ 𝑉 ∧ 𝑑 ⊆ 𝑉)))
49	6, 31, 48	3syl 18	. . . . . . 7 ⊢ (𝜑 → ((𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸) → (𝑐 ⊆ 𝑉 ∧ 𝑑 ⊆ 𝑉)))
50	49	imp 407	. . . . . 6 ⊢ ((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) → (𝑐 ⊆ 𝑉 ∧ 𝑑 ⊆ 𝑉))
51		f1imaeq 7217	. . . . . 6 ⊢ ((𝐹:𝑉–1-1→𝑊 ∧ (𝑐 ⊆ 𝑉 ∧ 𝑑 ⊆ 𝑉)) → ((𝐹 “ 𝑐) = (𝐹 “ 𝑑) ↔ 𝑐 = 𝑑))
52	30, 50, 51	syl2an2r 683	. . . . 5 ⊢ ((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) → ((𝐹 “ 𝑐) = (𝐹 “ 𝑑) ↔ 𝑐 = 𝑑))
53	52	biimpd 228	. . . 4 ⊢ ((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) → ((𝐹 “ 𝑐) = (𝐹 “ 𝑑) → 𝑐 = 𝑑))
54	28, 53	sylbid 239	. . 3 ⊢ ((𝜑 ∧ (𝑐 ∈ 𝐸 ∧ 𝑑 ∈ 𝐸)) → ((𝐺‘𝑐) = (𝐺‘𝑑) → 𝑐 = 𝑑))
55	54	ralrimivva 3193	. 2 ⊢ (𝜑 → ∀𝑐 ∈ 𝐸 ∀𝑑 ∈ 𝐸 ((𝐺‘𝑐) = (𝐺‘𝑑) → 𝑐 = 𝑑))
56		dff13 7207	. 2 ⊢ (𝐺:𝐸–1-1→𝐾 ↔ (𝐺:𝐸⟶𝐾 ∧ ∀𝑐 ∈ 𝐸 ∀𝑑 ∈ 𝐸 ((𝐺‘𝑐) = (𝐺‘𝑑) → 𝑐 = 𝑑)))
57	9, 55, 56	sylanbrc 583	1 ⊢ (𝜑 → 𝐺:𝐸–1-1→𝐾)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3060   ⊆ wss 3913  𝒫 cpw 4565  {cpr 4593   ↦ cmpt 5193   “ cima 5641  ⟶wf 6497  –1-1→wf1 6498  –1-1-onto→wf1o 6500  ‘cfv 6501  Vtxcvtx 28010  Edgcedg 28061  UHGraphcuhgr 28070  UPGraphcupgr 28094  USPGraphcuspgr 28162

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-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677  ax-cnex 11116  ax-resscn 11117  ax-1cn 11118  ax-icn 11119  ax-addcl 11120  ax-addrcl 11121  ax-mulcl 11122  ax-mulrcl 11123  ax-mulcom 11124  ax-addass 11125  ax-mulass 11126  ax-distr 11127  ax-i2m1 11128  ax-1ne0 11129  ax-1rid 11130  ax-rnegex 11131  ax-rrecex 11132  ax-cnre 11133  ax-pre-lttri 11134  ax-pre-lttrn 11135  ax-pre-ltadd 11136  ax-pre-mulgt0 11137

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-reu 3352  df-rab 3406  df-v 3448  df-sbc 3743  df-csb 3859  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-int 4913  df-iun 4961  df-br 5111  df-opab 5173  df-mpt 5194  df-tr 5228  df-id 5536  df-eprel 5542  df-po 5550  df-so 5551  df-fr 5593  df-we 5595  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6258  df-ord 6325  df-on 6326  df-lim 6327  df-suc 6328  df-iota 6453  df-fun 6503  df-fn 6504  df-f 6505  df-f1 6506  df-fo 6507  df-f1o 6508  df-fv 6509  df-riota 7318  df-ov 7365  df-oprab 7366  df-mpo 7367  df-om 7808  df-1st 7926  df-2nd 7927  df-frecs 8217  df-wrecs 8248  df-recs 8322  df-rdg 8361  df-1o 8417  df-2o 8418  df-oadd 8421  df-er 8655  df-en 8891  df-dom 8892  df-sdom 8893  df-fin 8894  df-dju 9846  df-card 9884  df-pnf 11200  df-mnf 11201  df-xr 11202  df-ltxr 11203  df-le 11204  df-sub 11396  df-neg 11397  df-nn 12163  df-2 12225  df-n0 12423  df-xnn0 12495  df-z 12509  df-uz 12773  df-fz 13435  df-hash 14241  df-edg 28062  df-uhgr 28072  df-upgr 28096  df-uspgr 28164

This theorem is referenced by:  isomuspgrlem2e  46144