Theorem uspgrsprfo 46513

Description: The mapping 𝐹 is a function from the "simple pseudographs" with a fixed set of vertices 𝑉 onto the subsets of the set of pairs over the set 𝑉. (Contributed by AV, 25-Nov-2021.)

Hypotheses

Ref	Expression
uspgrsprf.p	⊢ 𝑃 = 𝒫 (Pairs‘𝑉)
uspgrsprf.g	⊢ 𝐺 = {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))}
uspgrsprf.f	⊢ 𝐹 = (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))

Assertion

Ref	Expression
uspgrsprfo	⊢ (𝑉 ∈ 𝑊 → 𝐹:𝐺–onto→𝑃)

Distinct variable groups:   𝑃,𝑒,𝑞,𝑣   𝑒,𝑉,𝑞,𝑣   𝑒,𝑊,𝑣   𝑔,𝐺   𝑃,𝑔,𝑒,𝑣   𝑊,𝑞

Allowed substitution hints:   𝐹(𝑣,𝑒,𝑔,𝑞)   𝐺(𝑣,𝑒,𝑞)   𝑉(𝑔)   𝑊(𝑔)

Proof of Theorem uspgrsprfo

Dummy variables 𝑎 𝑏 𝑓 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uspgrsprf.p	. . . 4 ⊢ 𝑃 = 𝒫 (Pairs‘𝑉)
2		uspgrsprf.g	. . . 4 ⊢ 𝐺 = {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))}
3		uspgrsprf.f	. . . 4 ⊢ 𝐹 = (𝑔 ∈ 𝐺 ↦ (2nd ‘𝑔))
4	1, 2, 3	uspgrsprf 46511	. . 3 ⊢ 𝐹:𝐺⟶𝑃
5	4	a1i 11	. 2 ⊢ (𝑉 ∈ 𝑊 → 𝐹:𝐺⟶𝑃)
6	1	eleq2i 2826	. . . . . . 7 ⊢ (𝑎 ∈ 𝑃 ↔ 𝑎 ∈ 𝒫 (Pairs‘𝑉))
7		velpw 4607	. . . . . . 7 ⊢ (𝑎 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑎 ⊆ (Pairs‘𝑉))
8	6, 7	bitri 275	. . . . . 6 ⊢ (𝑎 ∈ 𝑃 ↔ 𝑎 ⊆ (Pairs‘𝑉))
9		eqidd 2734	. . . . . . . . . 10 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → 𝑉 = 𝑉)
10		vex 3479	. . . . . . . . . . . . . . 15 ⊢ 𝑎 ∈ V
11	10	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → 𝑎 ∈ V)
12		f1oi 6869	. . . . . . . . . . . . . . . . 17 ⊢ ( I ↾ 𝑎):𝑎–1-1-onto→𝑎
13	12	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ( I ↾ 𝑎):𝑎–1-1-onto→𝑎)
14		dmresi 6050	. . . . . . . . . . . . . . . . 17 ⊢ dom ( I ↾ 𝑎) = 𝑎
15		f1oeq2 6820	. . . . . . . . . . . . . . . . 17 ⊢ (dom ( I ↾ 𝑎) = 𝑎 → (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑎 ↔ ( I ↾ 𝑎):𝑎–1-1-onto→𝑎))
16	14, 15	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑎 ↔ ( I ↾ 𝑎):𝑎–1-1-onto→𝑎)
17	13, 16	sylibr 233	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑎)
18		sprvalpwle2 46144	. . . . . . . . . . . . . . . . 17 ⊢ (𝑉 ∈ 𝑊 → (Pairs‘𝑉) = {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
19	18	sseq2d 4014	. . . . . . . . . . . . . . . 16 ⊢ (𝑉 ∈ 𝑊 → (𝑎 ⊆ (Pairs‘𝑉) ↔ 𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
20	19	biimpac 480	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → 𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
21	17, 20	jca 513	. . . . . . . . . . . . . 14 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑎 ∧ 𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
22		f1oeq3 6821	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝑎 → (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑓 ↔ ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑎))
23		sseq1 4007	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝑎 → (𝑓 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ 𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
24	22, 23	anbi12d 632	. . . . . . . . . . . . . 14 ⊢ (𝑓 = 𝑎 → ((( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑓 ∧ 𝑓 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}) ↔ (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑎 ∧ 𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})))
25	11, 21, 24	spcedv 3589	. . . . . . . . . . . . 13 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ∃𝑓(( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑓 ∧ 𝑓 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
26		resiexg 7902	. . . . . . . . . . . . . . 15 ⊢ (𝑎 ∈ V → ( I ↾ 𝑎) ∈ V)
27	10, 26	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ( I ↾ 𝑎) ∈ V
28	27	f11o 7930	. . . . . . . . . . . . 13 ⊢ (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1→{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ∃𝑓(( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto→𝑓 ∧ 𝑓 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
29	25, 28	sylibr 233	. . . . . . . . . . . 12 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1→{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
30	10	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝑎 ⊆ (Pairs‘𝑉) → 𝑎 ∈ V)
31	30	resiexd 7215	. . . . . . . . . . . . . 14 ⊢ (𝑎 ⊆ (Pairs‘𝑉) → ( I ↾ 𝑎) ∈ V)
32	31	anim1ci 617	. . . . . . . . . . . . 13 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → (𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑎) ∈ V))
33		isuspgrop 28411	. . . . . . . . . . . . 13 ⊢ ((𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑎) ∈ V) → (⟨𝑉, ( I ↾ 𝑎)⟩ ∈ USPGraph ↔ ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1→{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
34	32, 33	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → (⟨𝑉, ( I ↾ 𝑎)⟩ ∈ USPGraph ↔ ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1→{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
35	29, 34	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ⟨𝑉, ( I ↾ 𝑎)⟩ ∈ USPGraph)
36		fveqeq2 6898	. . . . . . . . . . . . 13 ⊢ (𝑞 = ⟨𝑉, ( I ↾ 𝑎)⟩ → ((Vtx‘𝑞) = 𝑉 ↔ (Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉))
37		fveqeq2 6898	. . . . . . . . . . . . 13 ⊢ (𝑞 = ⟨𝑉, ( I ↾ 𝑎)⟩ → ((Edg‘𝑞) = 𝑎 ↔ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎))
38	36, 37	anbi12d 632	. . . . . . . . . . . 12 ⊢ (𝑞 = ⟨𝑉, ( I ↾ 𝑎)⟩ → (((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎) ↔ ((Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉 ∧ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎)))
39	38	adantl 483	. . . . . . . . . . 11 ⊢ (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) ∧ 𝑞 = ⟨𝑉, ( I ↾ 𝑎)⟩) → (((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎) ↔ ((Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉 ∧ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎)))
40		opvtxfv 28254	. . . . . . . . . . . . . 14 ⊢ ((𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑎) ∈ V) → (Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉)
41	31, 40	sylan2 594	. . . . . . . . . . . . 13 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ⊆ (Pairs‘𝑉)) → (Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉)
42		edgopval 28301	. . . . . . . . . . . . . . 15 ⊢ ((𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑎) ∈ V) → (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = ran ( I ↾ 𝑎))
43	31, 42	sylan2 594	. . . . . . . . . . . . . 14 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ⊆ (Pairs‘𝑉)) → (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = ran ( I ↾ 𝑎))
44		rnresi 6072	. . . . . . . . . . . . . 14 ⊢ ran ( I ↾ 𝑎) = 𝑎
45	43, 44	eqtrdi 2789	. . . . . . . . . . . . 13 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ⊆ (Pairs‘𝑉)) → (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎)
46	41, 45	jca 513	. . . . . . . . . . . 12 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ⊆ (Pairs‘𝑉)) → ((Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉 ∧ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎))
47	46	ancoms 460	. . . . . . . . . . 11 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ((Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉 ∧ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎))
48	35, 39, 47	rspcedvd 3615	. . . . . . . . . 10 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))
49	9, 48	jca 513	. . . . . . . . 9 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎)))
50	2	eleq2i 2826	. . . . . . . . . 10 ⊢ (⟨𝑉, 𝑎⟩ ∈ 𝐺 ↔ ⟨𝑉, 𝑎⟩ ∈ {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))})
51	30	anim1ci 617	. . . . . . . . . . 11 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → (𝑉 ∈ 𝑊 ∧ 𝑎 ∈ V))
52		eqeq1 2737	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑉 → (𝑣 = 𝑉 ↔ 𝑉 = 𝑉))
53	52	adantr 482	. . . . . . . . . . . . 13 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝑎) → (𝑣 = 𝑉 ↔ 𝑉 = 𝑉))
54		eqeq2 2745	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑉 → ((Vtx‘𝑞) = 𝑣 ↔ (Vtx‘𝑞) = 𝑉))
55		eqeq2 2745	. . . . . . . . . . . . . . 15 ⊢ (𝑒 = 𝑎 → ((Edg‘𝑞) = 𝑒 ↔ (Edg‘𝑞) = 𝑎))
56	54, 55	bi2anan9 638	. . . . . . . . . . . . . 14 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝑎) → (((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒) ↔ ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎)))
57	56	rexbidv 3179	. . . . . . . . . . . . 13 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝑎) → (∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒) ↔ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎)))
58	53, 57	anbi12d 632	. . . . . . . . . . . 12 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝑎) → ((𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒)) ↔ (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))))
59	58	opelopabga 5533	. . . . . . . . . . 11 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ∈ V) → (⟨𝑉, 𝑎⟩ ∈ {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))} ↔ (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))))
60	51, 59	syl 17	. . . . . . . . . 10 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → (⟨𝑉, 𝑎⟩ ∈ {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))} ↔ (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))))
61	50, 60	bitrid 283	. . . . . . . . 9 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → (⟨𝑉, 𝑎⟩ ∈ 𝐺 ↔ (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))))
62	49, 61	mpbird 257	. . . . . . . 8 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ⟨𝑉, 𝑎⟩ ∈ 𝐺)
63		fveq2 6889	. . . . . . . . . 10 ⊢ (𝑏 = ⟨𝑉, 𝑎⟩ → (2nd ‘𝑏) = (2nd ‘⟨𝑉, 𝑎⟩))
64	63	eqeq2d 2744	. . . . . . . . 9 ⊢ (𝑏 = ⟨𝑉, 𝑎⟩ → (𝑎 = (2nd ‘𝑏) ↔ 𝑎 = (2nd ‘⟨𝑉, 𝑎⟩)))
65	64	adantl 483	. . . . . . . 8 ⊢ (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) ∧ 𝑏 = ⟨𝑉, 𝑎⟩) → (𝑎 = (2nd ‘𝑏) ↔ 𝑎 = (2nd ‘⟨𝑉, 𝑎⟩)))
66		op2ndg 7985	. . . . . . . . . . 11 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ∈ V) → (2nd ‘⟨𝑉, 𝑎⟩) = 𝑎)
67	66	elvd 3482	. . . . . . . . . 10 ⊢ (𝑉 ∈ 𝑊 → (2nd ‘⟨𝑉, 𝑎⟩) = 𝑎)
68	67	adantl 483	. . . . . . . . 9 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → (2nd ‘⟨𝑉, 𝑎⟩) = 𝑎)
69	68	eqcomd 2739	. . . . . . . 8 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → 𝑎 = (2nd ‘⟨𝑉, 𝑎⟩))
70	62, 65, 69	rspcedvd 3615	. . . . . . 7 ⊢ ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉 ∈ 𝑊) → ∃𝑏 ∈ 𝐺 𝑎 = (2nd ‘𝑏))
71	70	ex 414	. . . . . 6 ⊢ (𝑎 ⊆ (Pairs‘𝑉) → (𝑉 ∈ 𝑊 → ∃𝑏 ∈ 𝐺 𝑎 = (2nd ‘𝑏)))
72	8, 71	sylbi 216	. . . . 5 ⊢ (𝑎 ∈ 𝑃 → (𝑉 ∈ 𝑊 → ∃𝑏 ∈ 𝐺 𝑎 = (2nd ‘𝑏)))
73	72	impcom 409	. . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ∈ 𝑃) → ∃𝑏 ∈ 𝐺 𝑎 = (2nd ‘𝑏))
74	1, 2, 3	uspgrsprfv 46510	. . . . . . 7 ⊢ (𝑏 ∈ 𝐺 → (𝐹‘𝑏) = (2nd ‘𝑏))
75	74	adantl 483	. . . . . 6 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑎 ∈ 𝑃) ∧ 𝑏 ∈ 𝐺) → (𝐹‘𝑏) = (2nd ‘𝑏))
76	75	eqeq2d 2744	. . . . 5 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑎 ∈ 𝑃) ∧ 𝑏 ∈ 𝐺) → (𝑎 = (𝐹‘𝑏) ↔ 𝑎 = (2nd ‘𝑏)))
77	76	rexbidva 3177	. . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ∈ 𝑃) → (∃𝑏 ∈ 𝐺 𝑎 = (𝐹‘𝑏) ↔ ∃𝑏 ∈ 𝐺 𝑎 = (2nd ‘𝑏)))
78	73, 77	mpbird 257	. . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑎 ∈ 𝑃) → ∃𝑏 ∈ 𝐺 𝑎 = (𝐹‘𝑏))
79	78	ralrimiva 3147	. 2 ⊢ (𝑉 ∈ 𝑊 → ∀𝑎 ∈ 𝑃 ∃𝑏 ∈ 𝐺 𝑎 = (𝐹‘𝑏))
80		dffo3 7101	. 2 ⊢ (𝐹:𝐺–onto→𝑃 ↔ (𝐹:𝐺⟶𝑃 ∧ ∀𝑎 ∈ 𝑃 ∃𝑏 ∈ 𝐺 𝑎 = (𝐹‘𝑏)))
81	5, 79, 80	sylanbrc 584	1 ⊢ (𝑉 ∈ 𝑊 → 𝐹:𝐺–onto→𝑃)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1542  ∃wex 1782   ∈ wcel 2107  ∀wral 3062  ∃wrex 3071  {crab 3433  Vcvv 3475   ∖ cdif 3945   ⊆ wss 3948  ∅c0 4322  𝒫 cpw 4602  {csn 4628  ⟨cop 4634   class class class wbr 5148  {copab 5210   ↦ cmpt 5231   I cid 5573  dom cdm 5676  ran crn 5677   ↾ cres 5678  ⟶wf 6537  –1-1→wf1 6538  –onto→wfo 6539  –1-1-onto→wf1o 6540  ‘cfv 6541  2^nd c2nd 7971   ≤ cle 11246  2c2 12264  ♯chash 14287  Vtxcvtx 28246  Edgcedg 28297  USPGraphcuspgr 28398  Pairscspr 46132

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7722  ax-cnex 11163  ax-resscn 11164  ax-1cn 11165  ax-icn 11166  ax-addcl 11167  ax-addrcl 11168  ax-mulcl 11169  ax-mulrcl 11170  ax-mulcom 11171  ax-addass 11172  ax-mulass 11173  ax-distr 11174  ax-i2m1 11175  ax-1ne0 11176  ax-1rid 11177  ax-rnegex 11178  ax-rrecex 11179  ax-cnre 11180  ax-pre-lttri 11181  ax-pre-lttrn 11182  ax-pre-ltadd 11183  ax-pre-mulgt0 11184

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6298  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6493  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7362  df-ov 7409  df-oprab 7410  df-mpo 7411  df-om 7853  df-1st 7972  df-2nd 7973  df-frecs 8263  df-wrecs 8294  df-recs 8368  df-rdg 8407  df-1o 8463  df-2o 8464  df-oadd 8467  df-er 8700  df-en 8937  df-dom 8938  df-sdom 8939  df-fin 8940  df-dju 9893  df-card 9931  df-pnf 11247  df-mnf 11248  df-xr 11249  df-ltxr 11250  df-le 11251  df-sub 11443  df-neg 11444  df-nn 12210  df-2 12272  df-n0 12470  df-xnn0 12542  df-z 12556  df-uz 12820  df-fz 13482  df-hash 14288  df-vtx 28248  df-iedg 28249  df-edg 28298  df-upgr 28332  df-uspgr 28400  df-spr 46133

This theorem is referenced by:  uspgrsprf1o  46514