Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  frgrancvvdeq Structured version   Visualization version   GIF version

Theorem frgrancvvdeq 26569
 Description: In a finite friendship graph, two vertices which are not connected by an edge have the same degree. This corresponds to claim 1 in [Huneke] p. 1: "If x,y are elements of (the friendship graph) G and are not adjacent, then they have the same degree (i.e., the same number of adjacent vertices).". (Contributed by Alexander van der Vekens, 19-Dec-2017.)
Assertion
Ref Expression
frgrancvvdeq ((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) → ∀𝑥𝑉𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ((𝑉 VDeg 𝐸)‘𝑥) = ((𝑉 VDeg 𝐸)‘𝑦)))
Distinct variable groups:   𝑥,𝐸,𝑦   𝑥,𝑉,𝑦

Proof of Theorem frgrancvvdeq
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 frgrancvvdeqlem9 26568 . . 3 (𝑉 FriendGrph 𝐸 → ∀𝑥𝑉𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)))
21adantr 480 . 2 ((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) → ∀𝑥𝑉𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)))
3 simpr 476 . . . . . . . 8 (((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) → (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)))
43imp 444 . . . . . . 7 ((((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) ∧ 𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥)) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))
5 frisusgra 26519 . . . . . . . . . . . . . . 15 (𝑉 FriendGrph 𝐸𝑉 USGrph 𝐸)
65adantr 480 . . . . . . . . . . . . . 14 ((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) → 𝑉 USGrph 𝐸)
76adantr 480 . . . . . . . . . . . . 13 (((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) → 𝑉 USGrph 𝐸)
8 simpr 476 . . . . . . . . . . . . 13 (((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) → 𝑥𝑉)
9 simpr 476 . . . . . . . . . . . . . 14 ((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) → 𝐸 ∈ Fin)
109adantr 480 . . . . . . . . . . . . 13 (((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) → 𝐸 ∈ Fin)
117, 8, 103jca 1235 . . . . . . . . . . . 12 (((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) → (𝑉 USGrph 𝐸𝑥𝑉𝐸 ∈ Fin))
1211adantr 480 . . . . . . . . . . 11 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → (𝑉 USGrph 𝐸𝑥𝑉𝐸 ∈ Fin))
13 nbusgrafi 25977 . . . . . . . . . . 11 ((𝑉 USGrph 𝐸𝑥𝑉𝐸 ∈ Fin) → (⟨𝑉, 𝐸⟩ Neighbors 𝑥) ∈ Fin)
1412, 13syl 17 . . . . . . . . . 10 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → (⟨𝑉, 𝐸⟩ Neighbors 𝑥) ∈ Fin)
157adantr 480 . . . . . . . . . . . 12 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → 𝑉 USGrph 𝐸)
16 eldifi 3694 . . . . . . . . . . . . 13 (𝑦 ∈ (𝑉 ∖ {𝑥}) → 𝑦𝑉)
1716adantl 481 . . . . . . . . . . . 12 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → 𝑦𝑉)
1810adantr 480 . . . . . . . . . . . 12 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → 𝐸 ∈ Fin)
1915, 17, 183jca 1235 . . . . . . . . . . 11 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → (𝑉 USGrph 𝐸𝑦𝑉𝐸 ∈ Fin))
20 nbusgrafi 25977 . . . . . . . . . . 11 ((𝑉 USGrph 𝐸𝑦𝑉𝐸 ∈ Fin) → (⟨𝑉, 𝐸⟩ Neighbors 𝑦) ∈ Fin)
2119, 20syl 17 . . . . . . . . . 10 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → (⟨𝑉, 𝐸⟩ Neighbors 𝑦) ∈ Fin)
22 hasheqf1o 12999 . . . . . . . . . 10 (((⟨𝑉, 𝐸⟩ Neighbors 𝑥) ∈ Fin ∧ (⟨𝑉, 𝐸⟩ Neighbors 𝑦) ∈ Fin) → ((#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑥)) = (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) ↔ ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)))
2314, 21, 22syl2anc 691 . . . . . . . . 9 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → ((#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑥)) = (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) ↔ ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)))
2423adantr 480 . . . . . . . 8 (((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) → ((#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑥)) = (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) ↔ ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)))
2524adantr 480 . . . . . . 7 ((((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) ∧ 𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥)) → ((#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑥)) = (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) ↔ ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)))
264, 25mpbird 246 . . . . . 6 ((((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) ∧ 𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥)) → (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑥)) = (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑦)))
278adantr 480 . . . . . . . . . 10 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → 𝑥𝑉)
2815, 27, 183jca 1235 . . . . . . . . 9 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → (𝑉 USGrph 𝐸𝑥𝑉𝐸 ∈ Fin))
2928adantr 480 . . . . . . . 8 (((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) → (𝑉 USGrph 𝐸𝑥𝑉𝐸 ∈ Fin))
3029adantr 480 . . . . . . 7 ((((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) ∧ 𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥)) → (𝑉 USGrph 𝐸𝑥𝑉𝐸 ∈ Fin))
31 hashnbgravd 26439 . . . . . . 7 ((𝑉 USGrph 𝐸𝑥𝑉𝐸 ∈ Fin) → (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑥)) = ((𝑉 VDeg 𝐸)‘𝑥))
3230, 31syl 17 . . . . . 6 ((((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) ∧ 𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥)) → (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑥)) = ((𝑉 VDeg 𝐸)‘𝑥))
3319adantr 480 . . . . . . . 8 (((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) → (𝑉 USGrph 𝐸𝑦𝑉𝐸 ∈ Fin))
3433adantr 480 . . . . . . 7 ((((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) ∧ 𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥)) → (𝑉 USGrph 𝐸𝑦𝑉𝐸 ∈ Fin))
35 hashnbgravd 26439 . . . . . . 7 ((𝑉 USGrph 𝐸𝑦𝑉𝐸 ∈ Fin) → (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) = ((𝑉 VDeg 𝐸)‘𝑦))
3634, 35syl 17 . . . . . 6 ((((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) ∧ 𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥)) → (#‘(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) = ((𝑉 VDeg 𝐸)‘𝑦))
3726, 32, 363eqtr3d 2652 . . . . 5 ((((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) ∧ (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦))) ∧ 𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥)) → ((𝑉 VDeg 𝐸)‘𝑥) = ((𝑉 VDeg 𝐸)‘𝑦))
3837exp31 628 . . . 4 ((((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) ∧ 𝑦 ∈ (𝑉 ∖ {𝑥})) → ((𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) → (𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ((𝑉 VDeg 𝐸)‘𝑥) = ((𝑉 VDeg 𝐸)‘𝑦))))
3938ralimdva 2945 . . 3 (((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) ∧ 𝑥𝑉) → (∀𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) → ∀𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ((𝑉 VDeg 𝐸)‘𝑥) = ((𝑉 VDeg 𝐸)‘𝑦))))
4039ralimdva 2945 . 2 ((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) → (∀𝑥𝑉𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ∃𝑓 𝑓:(⟨𝑉, 𝐸⟩ Neighbors 𝑥)–1-1-onto→(⟨𝑉, 𝐸⟩ Neighbors 𝑦)) → ∀𝑥𝑉𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ((𝑉 VDeg 𝐸)‘𝑥) = ((𝑉 VDeg 𝐸)‘𝑦))))
412, 40mpd 15 1 ((𝑉 FriendGrph 𝐸𝐸 ∈ Fin) → ∀𝑥𝑉𝑦 ∈ (𝑉 ∖ {𝑥})(𝑦 ∉ (⟨𝑉, 𝐸⟩ Neighbors 𝑥) → ((𝑉 VDeg 𝐸)‘𝑥) = ((𝑉 VDeg 𝐸)‘𝑦)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475  ∃wex 1695   ∈ wcel 1977   ∉ wnel 2781  ∀wral 2896   ∖ cdif 3537  {csn 4125  ⟨cop 4131   class class class wbr 4583  –1-1-onto→wf1o 5803  ‘cfv 5804  (class class class)co 6549  Fincfn 7841  #chash 12979   USGrph cusg 25859   Neighbors cnbgra 25946   VDeg cvdg 26420   FriendGrph cfrgra 26515 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-n0 11170  df-xnn0 11241  df-z 11255  df-uz 11564  df-xadd 11823  df-fz 12198  df-hash 12980  df-usgra 25862  df-nbgra 25949  df-vdgr 26421  df-frgra 26516 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator