Theorem isubgredg 48554

Description: An edge of an induced subgraph of a hypergraph is an edge of the hypergraph connecting vertices of the subgraph. (Contributed by AV, 24-Sep-2025.)

Hypotheses

Ref	Expression
isubgredg.v	⊢ 𝑉 = (Vtx‘𝐺)
isubgredg.e	⊢ 𝐸 = (Edg‘𝐺)
isubgredg.h	⊢ 𝐻 = (𝐺 ISubGr 𝑆)
isubgredg.i	⊢ 𝐼 = (Edg‘𝐻)

Assertion

Ref	Expression
isubgredg	⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐾 ∈ 𝐼 ↔ (𝐾 ∈ 𝐸 ∧ 𝐾 ⊆ 𝑆)))

Proof of Theorem isubgredg

Dummy variables 𝑥 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isubgredg.h	. . . . . . 7 ⊢ 𝐻 = (𝐺 ISubGr 𝑆)
2	1	fveq2i 6885	. . . . . 6 ⊢ (iEdg‘𝐻) = (iEdg‘(𝐺 ISubGr 𝑆))
3		isubgredg.v	. . . . . . 7 ⊢ 𝑉 = (Vtx‘𝐺)
4		eqid 2769	. . . . . . 7 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
5	3, 4	isubgriedg 48551	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (iEdg‘(𝐺 ISubGr 𝑆)) = ((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}))
6	2, 5	eqtrid 2816	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (iEdg‘𝐻) = ((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}))
7	6	rneqd 5929	. . . 4 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → ran (iEdg‘𝐻) = ran ((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}))
8	7	eleq2d 2855	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐾 ∈ ran (iEdg‘𝐻) ↔ 𝐾 ∈ ran ((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})))
9	3, 4	uhgrf 29353	. . . . . . 7 ⊢ (𝐺 ∈ UHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
10	9	adantr 485	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
11	10	ffnd 6707	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (iEdg‘𝐺) Fn dom (iEdg‘𝐺))
12		ssrab2 4042	. . . . . 6 ⊢ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} ⊆ dom (iEdg‘𝐺)
13	12	a1i 11	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} ⊆ dom (iEdg‘𝐺))
14	11, 13	fnssresd 6660	. . . 4 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → ((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) Fn {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})
15		fvelrnb 6942	. . . 4 ⊢ (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) Fn {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} → (𝐾 ∈ ran ((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) ↔ ∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾))
16	14, 15	syl 18	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐾 ∈ ran ((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) ↔ ∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾))
17		fvres 6901	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} → (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = ((iEdg‘𝐺)‘𝑥))
18	17	adantl 486	. . . . . . 7 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) → (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = ((iEdg‘𝐺)‘𝑥))
19	18	eqeq1d 2771	. . . . . 6 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) → ((((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾 ↔ ((iEdg‘𝐺)‘𝑥) = 𝐾))
20		fveq2 6882	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑥 → ((iEdg‘𝐺)‘𝑖) = ((iEdg‘𝐺)‘𝑥))
21	20	sseq1d 3976	. . . . . . . . . 10 ⊢ (𝑖 = 𝑥 → (((iEdg‘𝐺)‘𝑖) ⊆ 𝑆 ↔ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆))
22	21	elrab 3659	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} ↔ (𝑥 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆))
23	4	uhgrfun 29357	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ UHGraph → Fun (iEdg‘𝐺))
24	23	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → Fun (iEdg‘𝐺))
25		simpl 487	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆) → 𝑥 ∈ dom (iEdg‘𝐺))
26		fvelrn 7072	. . . . . . . . . . . 12 ⊢ ((Fun (iEdg‘𝐺) ∧ 𝑥 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑥) ∈ ran (iEdg‘𝐺))
27	24, 25, 26	syl2anr 608	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆) ∧ (𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉)) → ((iEdg‘𝐺)‘𝑥) ∈ ran (iEdg‘𝐺))
28		simpr 489	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆) → ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆)
29	28	adantr 485	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆) ∧ (𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉)) → ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆)
30	27, 29	jca 520	. . . . . . . . . 10 ⊢ (((𝑥 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆) ∧ (𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉)) → (((iEdg‘𝐺)‘𝑥) ∈ ran (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆))
31	30	ex 417	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆) → ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (((iEdg‘𝐺)‘𝑥) ∈ ran (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆)))
32	22, 31	sylbi 220	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} → ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (((iEdg‘𝐺)‘𝑥) ∈ ran (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆)))
33	32	impcom 412	. . . . . . 7 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) → (((iEdg‘𝐺)‘𝑥) ∈ ran (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆))
34		eleq1 2857	. . . . . . . 8 ⊢ (((iEdg‘𝐺)‘𝑥) = 𝐾 → (((iEdg‘𝐺)‘𝑥) ∈ ran (iEdg‘𝐺) ↔ 𝐾 ∈ ran (iEdg‘𝐺)))
35		sseq1 3970	. . . . . . . 8 ⊢ (((iEdg‘𝐺)‘𝑥) = 𝐾 → (((iEdg‘𝐺)‘𝑥) ⊆ 𝑆 ↔ 𝐾 ⊆ 𝑆))
36	34, 35	anbi12d 643	. . . . . . 7 ⊢ (((iEdg‘𝐺)‘𝑥) = 𝐾 → ((((iEdg‘𝐺)‘𝑥) ∈ ran (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆) ↔ (𝐾 ∈ ran (iEdg‘𝐺) ∧ 𝐾 ⊆ 𝑆)))
37	33, 36	syl5ibcom 248	. . . . . 6 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) → (((iEdg‘𝐺)‘𝑥) = 𝐾 → (𝐾 ∈ ran (iEdg‘𝐺) ∧ 𝐾 ⊆ 𝑆)))
38	19, 37	sylbid 243	. . . . 5 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) → ((((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾 → (𝐾 ∈ ran (iEdg‘𝐺) ∧ 𝐾 ⊆ 𝑆)))
39	38	rexlimdva 3172	. . . 4 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾 → (𝐾 ∈ ran (iEdg‘𝐺) ∧ 𝐾 ⊆ 𝑆)))
40		edgval 29340	. . . . . . . . . . 11 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
41	40	eqcomi 2778	. . . . . . . . . 10 ⊢ ran (iEdg‘𝐺) = (Edg‘𝐺)
42	41	eleq2i 2861	. . . . . . . . 9 ⊢ (𝐾 ∈ ran (iEdg‘𝐺) ↔ 𝐾 ∈ (Edg‘𝐺))
43	4	edgiedgb 29345	. . . . . . . . 9 ⊢ (Fun (iEdg‘𝐺) → (𝐾 ∈ (Edg‘𝐺) ↔ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐾 = ((iEdg‘𝐺)‘𝑥)))
44	42, 43	bitrid 286	. . . . . . . 8 ⊢ (Fun (iEdg‘𝐺) → (𝐾 ∈ ran (iEdg‘𝐺) ↔ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐾 = ((iEdg‘𝐺)‘𝑥)))
45	23, 44	syl 18	. . . . . . 7 ⊢ (𝐺 ∈ UHGraph → (𝐾 ∈ ran (iEdg‘𝐺) ↔ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐾 = ((iEdg‘𝐺)‘𝑥)))
46	45	adantr 485	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐾 ∈ ran (iEdg‘𝐺) ↔ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐾 = ((iEdg‘𝐺)‘𝑥)))
47		simprl 782	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) ∧ (𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥))) → 𝑥 ∈ dom (iEdg‘𝐺))
48		simpr 489	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥)) → 𝐾 = ((iEdg‘𝐺)‘𝑥))
49	48	sseq1d 3976	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥)) → (𝐾 ⊆ 𝑆 ↔ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆))
50	49	biimpcd 252	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ⊆ 𝑆 → ((𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥)) → ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆))
51	50	adantl 486	. . . . . . . . . . . . . 14 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) → ((𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥)) → ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆))
52	51	imp 411	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) ∧ (𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥))) → ((iEdg‘𝐺)‘𝑥) ⊆ 𝑆)
53	47, 52, 22	sylanbrc 594	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) ∧ (𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥))) → 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})
54		simpr 489	. . . . . . . . . . . . 13 ⊢ (((((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) ∧ (𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥))) ∧ 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) → 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})
55	48	eqcomd 2775	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥)) → ((iEdg‘𝐺)‘𝑥) = 𝐾)
56	55	adantl 486	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) ∧ (𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥))) → ((iEdg‘𝐺)‘𝑥) = 𝐾)
57	17, 56	sylan9eqr 2826	. . . . . . . . . . . . 13 ⊢ (((((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) ∧ (𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥))) ∧ 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) → (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾)
58	54, 57	jca 520	. . . . . . . . . . . 12 ⊢ (((((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) ∧ (𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥))) ∧ 𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆}) → (𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} ∧ (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾))
59	53, 58	mpdan 699	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) ∧ (𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥))) → (𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} ∧ (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾))
60	59	ex 417	. . . . . . . . . 10 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) → ((𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥)) → (𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} ∧ (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾)))
61	60	eximdv 1944	. . . . . . . . 9 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) → (∃𝑥(𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥)) → ∃𝑥(𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} ∧ (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾)))
62		df-rex 3096	. . . . . . . . 9 ⊢ (∃𝑥 ∈ dom (iEdg‘𝐺)𝐾 = ((iEdg‘𝐺)‘𝑥) ↔ ∃𝑥(𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐾 = ((iEdg‘𝐺)‘𝑥)))
63		df-rex 3096	. . . . . . . . 9 ⊢ (∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾 ↔ ∃𝑥(𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} ∧ (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾))
64	61, 62, 63	3imtr4g 299	. . . . . . . 8 ⊢ (((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) ∧ 𝐾 ⊆ 𝑆) → (∃𝑥 ∈ dom (iEdg‘𝐺)𝐾 = ((iEdg‘𝐺)‘𝑥) → ∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾))
65	64	ex 417	. . . . . . 7 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐾 ⊆ 𝑆 → (∃𝑥 ∈ dom (iEdg‘𝐺)𝐾 = ((iEdg‘𝐺)‘𝑥) → ∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾)))
66	65	com23 87	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (∃𝑥 ∈ dom (iEdg‘𝐺)𝐾 = ((iEdg‘𝐺)‘𝑥) → (𝐾 ⊆ 𝑆 → ∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾)))
67	46, 66	sylbid 243	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐾 ∈ ran (iEdg‘𝐺) → (𝐾 ⊆ 𝑆 → ∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾)))
68	67	impd 415	. . . 4 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → ((𝐾 ∈ ran (iEdg‘𝐺) ∧ 𝐾 ⊆ 𝑆) → ∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾))
69	39, 68	impbid 215	. . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (∃𝑥 ∈ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆} (((iEdg‘𝐺) ↾ {𝑖 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑆})‘𝑥) = 𝐾 ↔ (𝐾 ∈ ran (iEdg‘𝐺) ∧ 𝐾 ⊆ 𝑆)))
70	8, 16, 69	3bitrd 308	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐾 ∈ ran (iEdg‘𝐻) ↔ (𝐾 ∈ ran (iEdg‘𝐺) ∧ 𝐾 ⊆ 𝑆)))
71		isubgredg.i	. . . 4 ⊢ 𝐼 = (Edg‘𝐻)
72		edgval 29340	. . . 4 ⊢ (Edg‘𝐻) = ran (iEdg‘𝐻)
73	71, 72	eqtri 2792	. . 3 ⊢ 𝐼 = ran (iEdg‘𝐻)
74	73	eleq2i 2861	. 2 ⊢ (𝐾 ∈ 𝐼 ↔ 𝐾 ∈ ran (iEdg‘𝐻))
75		isubgredg.e	. . . . 5 ⊢ 𝐸 = (Edg‘𝐺)
76	75, 40	eqtri 2792	. . . 4 ⊢ 𝐸 = ran (iEdg‘𝐺)
77	76	eleq2i 2861	. . 3 ⊢ (𝐾 ∈ 𝐸 ↔ 𝐾 ∈ ran (iEdg‘𝐺))
78	77	anbi1i 635	. 2 ⊢ ((𝐾 ∈ 𝐸 ∧ 𝐾 ⊆ 𝑆) ↔ (𝐾 ∈ ran (iEdg‘𝐺) ∧ 𝐾 ⊆ 𝑆))
79	70, 74, 78	3bitr4g 317	1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝑆 ⊆ 𝑉) → (𝐾 ∈ 𝐼 ↔ (𝐾 ∈ 𝐸 ∧ 𝐾 ⊆ 𝑆)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567  ∃wex 1806   ∈ wcel 2149  ∃wrex 3095  {crab 3423   ∖ cdif 3910   ⊆ wss 3913  ∅c0 4294  𝒫 cpw 4567  {csn 4594  dom cdm 5662  ran crn 5663   ↾ cres 5664  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7411  Vtxcvtx 29287  iEdgciedg 29288  Edgcedg 29338  UHGraphcuhgr 29347   ISubGr cisubgr 48548

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-2nd 7987  df-iedg 29290  df-edg 29339  df-uhgr 29349  df-isubgr 48549

This theorem is referenced by:  isubgr3stgrlem6  48659  isubgr3stgrlem7  48660  isubgr3stgrlem8  48661