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

Theorem isfrgr 30292
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.
StepHypRef Expression
1 fvex 6933 . . 3 (Vtx‘𝑔) ∈ V
2 fvex 6933 . . 3 (Edg‘𝑔) ∈ V
3 fveq2 6920 . . . . . . 7 (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
43eqeq2d 2751 . . . . . 6 (𝑔 = 𝐺 → (𝑣 = (Vtx‘𝑔) ↔ 𝑣 = (Vtx‘𝐺)))
5 isfrgr.v . . . . . . . 8 𝑉 = (Vtx‘𝐺)
65eqcomi 2749 . . . . . . 7 (Vtx‘𝐺) = 𝑉
76eqeq2i 2753 . . . . . 6 (𝑣 = (Vtx‘𝐺) ↔ 𝑣 = 𝑉)
84, 7bitrdi 287 . . . . 5 (𝑔 = 𝐺 → (𝑣 = (Vtx‘𝑔) ↔ 𝑣 = 𝑉))
9 fveq2 6920 . . . . . . 7 (𝑔 = 𝐺 → (Edg‘𝑔) = (Edg‘𝐺))
109eqeq2d 2751 . . . . . 6 (𝑔 = 𝐺 → (𝑒 = (Edg‘𝑔) ↔ 𝑒 = (Edg‘𝐺)))
11 isfrgr.e . . . . . . . 8 𝐸 = (Edg‘𝐺)
1211eqcomi 2749 . . . . . . 7 (Edg‘𝐺) = 𝐸
1312eqeq2i 2753 . . . . . 6 (𝑒 = (Edg‘𝐺) ↔ 𝑒 = 𝐸)
1410, 13bitrdi 287 . . . . 5 (𝑔 = 𝐺 → (𝑒 = (Edg‘𝑔) ↔ 𝑒 = 𝐸))
158, 14anbi12d 631 . . . 4 (𝑔 = 𝐺 → ((𝑣 = (Vtx‘𝑔) ∧ 𝑒 = (Edg‘𝑔)) ↔ (𝑣 = 𝑉𝑒 = 𝐸)))
16 simpl 482 . . . . 5 ((𝑣 = 𝑉𝑒 = 𝐸) → 𝑣 = 𝑉)
17 difeq1 4142 . . . . . . 7 (𝑣 = 𝑉 → (𝑣 ∖ {𝑘}) = (𝑉 ∖ {𝑘}))
1817adantr 480 . . . . . 6 ((𝑣 = 𝑉𝑒 = 𝐸) → (𝑣 ∖ {𝑘}) = (𝑉 ∖ {𝑘}))
19 reueq1 3426 . . . . . . . 8 (𝑣 = 𝑉 → (∃!𝑥𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒))
2019adantr 480 . . . . . . 7 ((𝑣 = 𝑉𝑒 = 𝐸) → (∃!𝑥𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒))
21 sseq2 4035 . . . . . . . . 9 (𝑒 = 𝐸 → ({{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
2221adantl 481 . . . . . . . 8 ((𝑣 = 𝑉𝑒 = 𝐸) → ({{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
2322reubidv 3406 . . . . . . 7 ((𝑣 = 𝑉𝑒 = 𝐸) → (∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
2420, 23bitrd 279 . . . . . 6 ((𝑣 = 𝑉𝑒 = 𝐸) → (∃!𝑥𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
2518, 24raleqbidv 3354 . . . . 5 ((𝑣 = 𝑉𝑒 = 𝐸) → (∀𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
2616, 25raleqbidv 3354 . . . 4 ((𝑣 = 𝑉𝑒 = 𝐸) → (∀𝑘𝑣𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∀𝑘𝑉𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
2715, 26biimtrdi 253 . . 3 (𝑔 = 𝐺 → ((𝑣 = (Vtx‘𝑔) ∧ 𝑒 = (Edg‘𝑔)) → (∀𝑘𝑣𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∀𝑘𝑉𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸)))
281, 2, 27sbc2iedv 3889 . 2 (𝑔 = 𝐺 → ([(Vtx‘𝑔) / 𝑣][(Edg‘𝑔) / 𝑒]𝑘𝑣𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒 ↔ ∀𝑘𝑉𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
29 df-frgr 30291 . 2 FriendGraph = {𝑔 ∈ USGraph ∣ [(Vtx‘𝑔) / 𝑣][(Edg‘𝑔) / 𝑒]𝑘𝑣𝑙 ∈ (𝑣 ∖ {𝑘})∃!𝑥𝑣 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝑒}
3028, 29elrab2 3711 1 (𝐺 ∈ FriendGraph ↔ (𝐺 ∈ USGraph ∧ ∀𝑘𝑉𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑥𝑉 {{𝑥, 𝑘}, {𝑥, 𝑙}} ⊆ 𝐸))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1537  wcel 2108  wral 3067  ∃!wreu 3386  [wsbc 3804  cdif 3973  wss 3976  {csn 4648  {cpr 4650  cfv 6573  Vtxcvtx 29031  Edgcedg 29082  USGraphcusgr 29184   FriendGraph cfrgr 30290
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-nul 5324
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581  df-frgr 30291
This theorem is referenced by:  frgrusgr  30293  frgr0v  30294  frgr0  30297  frcond1  30298  frgr1v  30303  nfrgr2v  30304  frgr3v  30307  2pthfrgrrn  30314  n4cyclfrgr  30323
  Copyright terms: Public domain W3C validator