Theorem isfrgr 28033

Description: The property of being a friendship graph. (Contributed by Alexander van der Vekens, 4-Oct-2017.) (Revised by AV, 29-Mar-2021.) (Revised by AV, 3-Jan-2024.)

Hypotheses

Ref	Expression
isfrgr.v	⊢ 𝑉 = (Vtx‘𝐺)
isfrgr.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
isfrgr	⊢ (𝐺 ∈ FriendGraph ↔ (𝐺 ∈ USGraph ∧ ∀𝑘 ∈ 𝑉 ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))

Distinct variable groups:   𝑘,𝐸,𝑙,𝑥   𝑘,𝑉,𝑙,𝑥

Allowed substitution hints:   𝐺(𝑥,𝑘,𝑙)

Proof of Theorem isfrgr

Dummy variables 𝑒 𝑔 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvex 6678	. . 3 ⊢ (Vtx‘𝑔) ∈ V
2		fvex 6678	. . 3 ⊢ (Edg‘𝑔) ∈ V
3		fveq2 6665	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
4	3	eqeq2d 2832	. . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑣 = (Vtx‘𝑔) ↔ 𝑣 = (Vtx‘𝐺)))
5		isfrgr.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
6	5	eqcomi 2830	. . . . . . 7 ⊢ (Vtx‘𝐺) = 𝑉
7	6	eqeq2i 2834	. . . . . 6 ⊢ (𝑣 = (Vtx‘𝐺) ↔ 𝑣 = 𝑉)
8	4, 7	syl6bb 289	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑣 = (Vtx‘𝑔) ↔ 𝑣 = 𝑉))
9		fveq2 6665	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Edg‘𝑔) = (Edg‘𝐺))
10	9	eqeq2d 2832	. . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑒 = (Edg‘𝑔) ↔ 𝑒 = (Edg‘𝐺)))
11		isfrgr.e	. . . . . . . 8 ⊢ 𝐸 = (Edg‘𝐺)
12	11	eqcomi 2830	. . . . . . 7 ⊢ (Edg‘𝐺) = 𝐸
13	12	eqeq2i 2834	. . . . . 6 ⊢ (𝑒 = (Edg‘𝐺) ↔ 𝑒 = 𝐸)
14	10, 13	syl6bb 289	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑒 = (Edg‘𝑔) ↔ 𝑒 = 𝐸))
15	8, 14	anbi12d 632	. . . 4 ⊢ (𝑔 = 𝐺 → ((𝑣 = (Vtx‘𝑔) ∧ 𝑒 = (Edg‘𝑔)) ↔ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)))
16		simpl 485	. . . . 5 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → 𝑣 = 𝑉)
17		difeq1 4092	. . . . . . 7 ⊢ (𝑣 = 𝑉 → (𝑣 ∖ {𝑘}) = (𝑉 ∖ {𝑘}))
18	17	adantr 483	. . . . . 6 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝑣 ∖ {𝑘}) = (𝑉 ∖ {𝑘}))
19		reueq1 3408	. . . . . . . 8 ⊢ (𝑣 = 𝑉 → (∃!𝑥 ∈ 𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒))
20	19	adantr 483	. . . . . . 7 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (∃!𝑥 ∈ 𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒))
21		sseq2 3993	. . . . . . . . 9 ⊢ (𝑒 = 𝐸 → ({{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
22	21	adantl 484	. . . . . . . 8 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → ({{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
23	22	reubidv 3390	. . . . . . 7 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
24	20, 23	bitrd 281	. . . . . 6 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (∃!𝑥 ∈ 𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
25	18, 24	raleqbidv 3402	. . . . 5 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (∀𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥 ∈ 𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
26	16, 25	raleqbidv 3402	. . . 4 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (∀𝑘 ∈ 𝑣 ∀𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥 ∈ 𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∀𝑘 ∈ 𝑉 ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
27	15, 26	syl6bi 255	. . 3 ⊢ (𝑔 = 𝐺 → ((𝑣 = (Vtx‘𝑔) ∧ 𝑒 = (Edg‘𝑔)) → (∀𝑘 ∈ 𝑣 ∀𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥 ∈ 𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∀𝑘 ∈ 𝑉 ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸)))
28	1, 2, 27	sbc2iedv 3851	. 2 ⊢ (𝑔 = 𝐺 → ([(Vtx‘𝑔) / 𝑣][(Edg‘𝑔) / 𝑒]∀𝑘 ∈ 𝑣 ∀𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥 ∈ 𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∀𝑘 ∈ 𝑉 ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
29		df-frgr 28032	. 2 ⊢ FriendGraph = {𝑔 ∈ USGraph ∣ [(Vtx‘𝑔) / 𝑣][(Edg‘𝑔) / 𝑒]∀𝑘 ∈ 𝑣 ∀𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥 ∈ 𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒}
30	28, 29	elrab2 3683	1 ⊢ (𝐺 ∈ FriendGraph ↔ (𝐺 ∈ USGraph ∧ ∀𝑘 ∈ 𝑉 ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥 ∈ 𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))

Syntax hints:   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∀wral 3138  ∃!wreu 3140  [wsbc 3772   ∖ cdif 3933   ⊆ wss 3936  {csn 4561  {cpr 4563  ‘cfv 6350  Vtxcvtx 26775  Edgcedg 26826  USGraphcusgr 26928   FriendGraph cfrgr 28031

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-nul 5203

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3497  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-br 5060  df-iota 6309  df-fv 6358  df-frgr 28032

This theorem is referenced by:  frgrusgr  28034  frgr0v  28035  frgr0  28038  frcond1  28039  frgr1v  28044  nfrgr2v  28045  frgr3v  28048  2pthfrgrrn  28055  n4cyclfrgr  28064