Theorem isomgrtr 44357

Description: The isomorphy relation is transitive for hypergraphs. (Contributed by AV, 5-Dec-2022.)

Assertion

Ref	Expression
isomgrtr	⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → ((𝐴 IsomGr 𝐵 ∧ 𝐵 IsomGr 𝐶) → 𝐴 IsomGr 𝐶))

Proof of Theorem isomgrtr

Dummy variables 𝑖 𝑗 𝑘 𝑓 𝑔 𝑣 𝑤 𝑒 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2798	. . . . 5 ⊢ (Vtx‘𝐴) = (Vtx‘𝐴)
2		eqid 2798	. . . . 5 ⊢ (Vtx‘𝐵) = (Vtx‘𝐵)
3		eqid 2798	. . . . 5 ⊢ (iEdg‘𝐴) = (iEdg‘𝐴)
4		eqid 2798	. . . . 5 ⊢ (iEdg‘𝐵) = (iEdg‘𝐵)
5	1, 2, 3, 4	isomgr 44341	. . . 4 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph) → (𝐴 IsomGr 𝐵 ↔ ∃𝑓(𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))))
6	5	3adant3 1129	. . 3 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → (𝐴 IsomGr 𝐵 ↔ ∃𝑓(𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))))
7		eqid 2798	. . . . 5 ⊢ (Vtx‘𝐶) = (Vtx‘𝐶)
8		eqid 2798	. . . . 5 ⊢ (iEdg‘𝐶) = (iEdg‘𝐶)
9	2, 7, 4, 8	isomgr 44341	. . . 4 ⊢ ((𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → (𝐵 IsomGr 𝐶 ↔ ∃𝑣(𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))))
10	9	3adant1 1127	. . 3 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → (𝐵 IsomGr 𝐶 ↔ ∃𝑣(𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))))
11	6, 10	anbi12d 633	. 2 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → ((𝐴 IsomGr 𝐵 ∧ 𝐵 IsomGr 𝐶) ↔ (∃𝑓(𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) ∧ ∃𝑣(𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))))))
12		vex 3444	. . . . . . . . . . 11 ⊢ 𝑣 ∈ V
13		vex 3444	. . . . . . . . . . 11 ⊢ 𝑓 ∈ V
14	12, 13	coex 7617	. . . . . . . . . 10 ⊢ (𝑣 ∘ 𝑓) ∈ V
15	14	a1i 11	. . . . . . . . 9 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) ∧ (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))) → (𝑣 ∘ 𝑓) ∈ V)
16		simpl 486	. . . . . . . . . . 11 ⊢ ((𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶))
17		simprl 770	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) → 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵))
18		f1oco 6612	. . . . . . . . . . 11 ⊢ ((𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵)) → (𝑣 ∘ 𝑓):(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶))
19	16, 17, 18	syl2anr 599	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) ∧ (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))) → (𝑣 ∘ 𝑓):(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶))
20		vex 3444	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝑤 ∈ V
21		vex 3444	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝑔 ∈ V
22	20, 21	coex 7617	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑤 ∘ 𝑔) ∈ V
23	22	a1i 11	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → (𝑤 ∘ 𝑔) ∈ V)
24		simpl 486	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))) → 𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶))
25		simprl 770	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) → 𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵))
26		f1oco 6612	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ 𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵)) → (𝑤 ∘ 𝑔):dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶))
27	24, 25, 26	syl2anr 599	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → (𝑤 ∘ 𝑔):dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶))
28		isomgrtrlem 44356	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘((𝑤 ∘ 𝑔)‘𝑗)))
29	27, 28	jca 515	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → ((𝑤 ∘ 𝑔):dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘((𝑤 ∘ 𝑔)‘𝑗))))
30		f1oeq1 6579	. . . . . . . . . . . . . . . . . . . 20 ⊢ (ℎ = (𝑤 ∘ 𝑔) → (ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ↔ (𝑤 ∘ 𝑔):dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶)))
31		fveq1 6644	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (ℎ = (𝑤 ∘ 𝑔) → (ℎ‘𝑗) = ((𝑤 ∘ 𝑔)‘𝑗))
32	31	fveq2d 6649	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (ℎ = (𝑤 ∘ 𝑔) → ((iEdg‘𝐶)‘(ℎ‘𝑗)) = ((iEdg‘𝐶)‘((𝑤 ∘ 𝑔)‘𝑗)))
33	32	eqeq2d 2809	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (ℎ = (𝑤 ∘ 𝑔) → (((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)) ↔ ((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘((𝑤 ∘ 𝑔)‘𝑗))))
34	33	ralbidv 3162	. . . . . . . . . . . . . . . . . . . 20 ⊢ (ℎ = (𝑤 ∘ 𝑔) → (∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)) ↔ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘((𝑤 ∘ 𝑔)‘𝑗))))
35	30, 34	anbi12d 633	. . . . . . . . . . . . . . . . . . 19 ⊢ (ℎ = (𝑤 ∘ 𝑔) → ((ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))) ↔ ((𝑤 ∘ 𝑔):dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘((𝑤 ∘ 𝑔)‘𝑗)))))
36	23, 29, 35	spcedv 3547	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))
37	36	ex 416	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) → ((𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)))))
38	37	exlimdv 1934	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) → (∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)))))
39	38	ex 416	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) → ((𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))) → (∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))
40	39	exlimdv 1934	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) → (∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))) → (∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))
41	40	3exp 1116	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) → (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) → (∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))) → (∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))))
42	41	com34 91	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) → (∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))) → (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) → (∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))))
43	42	imp32 422	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) → (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) → (∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))
44	43	imp32 422	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) ∧ (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))) → ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))
45	19, 44	jca 515	. . . . . . . . 9 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) ∧ (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))) → ((𝑣 ∘ 𝑓):(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶) ∧ ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)))))
46		f1oeq1 6579	. . . . . . . . . 10 ⊢ (𝑒 = (𝑣 ∘ 𝑓) → (𝑒:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶) ↔ (𝑣 ∘ 𝑓):(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶)))
47		imaeq1 5891	. . . . . . . . . . . . . 14 ⊢ (𝑒 = (𝑣 ∘ 𝑓) → (𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)))
48	47	eqeq1d 2800	. . . . . . . . . . . . 13 ⊢ (𝑒 = (𝑣 ∘ 𝑓) → ((𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)) ↔ ((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))
49	48	ralbidv 3162	. . . . . . . . . . . 12 ⊢ (𝑒 = (𝑣 ∘ 𝑓) → (∀𝑗 ∈ dom (iEdg‘𝐴)(𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)) ↔ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))
50	49	anbi2d 631	. . . . . . . . . . 11 ⊢ (𝑒 = (𝑣 ∘ 𝑓) → ((ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)(𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))) ↔ (ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)))))
51	50	exbidv 1922	. . . . . . . . . 10 ⊢ (𝑒 = (𝑣 ∘ 𝑓) → (∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)(𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))) ↔ ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)))))
52	46, 51	anbi12d 633	. . . . . . . . 9 ⊢ (𝑒 = (𝑣 ∘ 𝑓) → ((𝑒:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶) ∧ ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)(𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)))) ↔ ((𝑣 ∘ 𝑓):(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶) ∧ ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣 ∘ 𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))
53	15, 45, 52	spcedv 3547	. . . . . . . 8 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) ∧ (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))) → ∃𝑒(𝑒:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶) ∧ ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)(𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗)))))
54	1, 7, 3, 8	isomgr 44341	. . . . . . . . . 10 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → (𝐴 IsomGr 𝐶 ↔ ∃𝑒(𝑒:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶) ∧ ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)(𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))
55	54	3adant2 1128	. . . . . . . . 9 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → (𝐴 IsomGr 𝐶 ↔ ∃𝑒(𝑒:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶) ∧ ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)(𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))
56	55	ad2antrr 725	. . . . . . . 8 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) ∧ (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))) → (𝐴 IsomGr 𝐶 ↔ ∃𝑒(𝑒:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐶) ∧ ∃ℎ(ℎ:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑗 ∈ dom (iEdg‘𝐴)(𝑒 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘(ℎ‘𝑗))))))
57	53, 56	mpbird 260	. . . . . . 7 ⊢ ((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) ∧ (𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))) → 𝐴 IsomGr 𝐶)
58	57	ex 416	. . . . . 6 ⊢ (((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) → ((𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → 𝐴 IsomGr 𝐶))
59	58	exlimdv 1934	. . . . 5 ⊢ (((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) ∧ (𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖))))) → (∃𝑣(𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → 𝐴 IsomGr 𝐶))
60	59	ex 416	. . . 4 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → ((𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) → (∃𝑣(𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → 𝐴 IsomGr 𝐶)))
61	60	exlimdv 1934	. . 3 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → (∃𝑓(𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) → (∃𝑣(𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘)))) → 𝐴 IsomGr 𝐶)))
62	61	impd 414	. 2 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → ((∃𝑓(𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ ∃𝑔(𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔‘𝑖)))) ∧ ∃𝑣(𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶) ∧ ∃𝑤(𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤‘𝑘))))) → 𝐴 IsomGr 𝐶))
63	11, 62	sylbid 243	1 ⊢ ((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶 ∈ 𝑋) → ((𝐴 IsomGr 𝐵 ∧ 𝐵 IsomGr 𝐶) → 𝐴 IsomGr 𝐶))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538  ∃wex 1781   ∈ wcel 2111  ∀wral 3106  Vcvv 3441   class class class wbr 5030  dom cdm 5519   “ cima 5522   ∘ ccom 5523  –1-1-onto→wf1o 6323  ‘cfv 6324  Vtxcvtx 26789  iEdgciedg 26790  UHGraphcuhgr 26849   IsomGr cisomgr 44337

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-pow 5231  ax-pr 5295  ax-un 7441

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-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isomgr 44339

This theorem is referenced by: (None)