Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  stgrusgra Structured version   Visualization version   GIF version

Theorem stgrusgra 49390
Description: The star graph SN is a simple graph. (Contributed by AV, 11-Sep-2025.)
Assertion
Ref Expression
stgrusgra (𝑁 ∈ ℕ0 → (StarGr‘𝑁) ∈ USGraph)

Proof of Theorem stgrusgra
Dummy variables 𝑒 𝑘 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1oi 6893 . . . . 5 ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}):{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}⟶1-1onto{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}
2 f1of1 6852 . . . . 5 (( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}):{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}⟶1-1onto{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}} → ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}):{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}⟶1-1{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}})
31, 2mp1i 14 . . . 4 (𝑁 ∈ ℕ0 → ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}):{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}⟶1-1{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}})
4 simpllr 788 . . . . . . . . . 10 ((((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ 𝒫 (0...𝑁)) ∧ 𝑥 ∈ (1...𝑁)) ∧ 𝑘 = {0, 𝑥}) → 𝑘 ∈ 𝒫 (0...𝑁))
5 fveq2 6915 . . . . . . . . . . 11 (𝑘 = {0, 𝑥} → (♯‘𝑘) = (♯‘{0, 𝑥}))
6 0red 11349 . . . . . . . . . . . . . 14 (𝑥 ∈ (1...𝑁) → 0 ∈ ℝ)
7 elfznn 13726 . . . . . . . . . . . . . . 15 (𝑥 ∈ (1...𝑁) → 𝑥 ∈ ℕ)
87nngt0d 12426 . . . . . . . . . . . . . 14 (𝑥 ∈ (1...𝑁) → 0 < 𝑥)
96, 8ltned 11484 . . . . . . . . . . . . 13 (𝑥 ∈ (1...𝑁) → 0 ≠ 𝑥)
10 c0ex 11338 . . . . . . . . . . . . . . 15 0 ∈ V
11 vex 3457 . . . . . . . . . . . . . . 15 𝑥 ∈ V
1210, 11pm3.2i 476 . . . . . . . . . . . . . 14 (0 ∈ V ∧ 𝑥 ∈ V)
13 hashprg 14579 . . . . . . . . . . . . . 14 ((0 ∈ V ∧ 𝑥 ∈ V) → (0 ≠ 𝑥 ↔ (♯‘{0, 𝑥}) = 2))
1412, 13mp1i 14 . . . . . . . . . . . . 13 (𝑥 ∈ (1...𝑁) → (0 ≠ 𝑥 ↔ (♯‘{0, 𝑥}) = 2))
159, 14mpbid 235 . . . . . . . . . . . 12 (𝑥 ∈ (1...𝑁) → (♯‘{0, 𝑥}) = 2)
1615adantl 487 . . . . . . . . . . 11 (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ 𝒫 (0...𝑁)) ∧ 𝑥 ∈ (1...𝑁)) → (♯‘{0, 𝑥}) = 2)
175, 16sylan9eqr 2823 . . . . . . . . . 10 ((((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ 𝒫 (0...𝑁)) ∧ 𝑥 ∈ (1...𝑁)) ∧ 𝑘 = {0, 𝑥}) → (♯‘𝑘) = 2)
184, 17jca 521 . . . . . . . . 9 ((((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ 𝒫 (0...𝑁)) ∧ 𝑥 ∈ (1...𝑁)) ∧ 𝑘 = {0, 𝑥}) → (𝑘 ∈ 𝒫 (0...𝑁) ∧ (♯‘𝑘) = 2))
1918ex 418 . . . . . . . 8 (((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ 𝒫 (0...𝑁)) ∧ 𝑥 ∈ (1...𝑁)) → (𝑘 = {0, 𝑥} → (𝑘 ∈ 𝒫 (0...𝑁) ∧ (♯‘𝑘) = 2)))
2019rexlimdva 3170 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ 𝒫 (0...𝑁)) → (∃𝑥 ∈ (1...𝑁)𝑘 = {0, 𝑥} → (𝑘 ∈ 𝒫 (0...𝑁) ∧ (♯‘𝑘) = 2)))
2120expimpd 459 . . . . . 6 (𝑁 ∈ ℕ0 → ((𝑘 ∈ 𝒫 (0...𝑁) ∧ ∃𝑥 ∈ (1...𝑁)𝑘 = {0, 𝑥}) → (𝑘 ∈ 𝒫 (0...𝑁) ∧ (♯‘𝑘) = 2)))
22 eqeq1 2770 . . . . . . . 8 (𝑒 = 𝑘 → (𝑒 = {0, 𝑥} ↔ 𝑘 = {0, 𝑥}))
2322rexbidv 3193 . . . . . . 7 (𝑒 = 𝑘 → (∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥} ↔ ∃𝑥 ∈ (1...𝑁)𝑘 = {0, 𝑥}))
2423elrab 3647 . . . . . 6 (𝑘 ∈ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}} ↔ (𝑘 ∈ 𝒫 (0...𝑁) ∧ ∃𝑥 ∈ (1...𝑁)𝑘 = {0, 𝑥}))
25 fveqeq2 6924 . . . . . . 7 (𝑒 = 𝑘 → ((♯‘𝑒) = 2 ↔ (♯‘𝑘) = 2))
2625elrab 3647 . . . . . 6 (𝑘 ∈ {𝑒 ∈ 𝒫 (0...𝑁) ∣ (♯‘𝑒) = 2} ↔ (𝑘 ∈ 𝒫 (0...𝑁) ∧ (♯‘𝑘) = 2))
2721, 24, 263imtr4g 299 . . . . 5 (𝑁 ∈ ℕ0 → (𝑘 ∈ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}} → 𝑘 ∈ {𝑒 ∈ 𝒫 (0...𝑁) ∣ (♯‘𝑒) = 2}))
2827ssrdv 3918 . . . 4 (𝑁 ∈ ℕ0 → {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}} ⊆ {𝑒 ∈ 𝒫 (0...𝑁) ∣ (♯‘𝑒) = 2})
29 f1ss 6814 . . . 4 ((( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}):{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}⟶1-1{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}} ∧ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}} ⊆ {𝑒 ∈ 𝒫 (0...𝑁) ∣ (♯‘𝑒) = 2}) → ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}):{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}⟶1-1{𝑒 ∈ 𝒫 (0...𝑁) ∣ (♯‘𝑒) = 2})
303, 28, 29syl2anc 596 . . 3 (𝑁 ∈ ℕ0 → ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}):{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}⟶1-1{𝑒 ∈ 𝒫 (0...𝑁) ∣ (♯‘𝑒) = 2})
31 stgriedg 49386 . . . 4 (𝑁 ∈ ℕ0 → (iEdg‘(StarGr‘𝑁)) = ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}))
3231dmeqd 5898 . . . . 5 (𝑁 ∈ ℕ0 → dom (iEdg‘(StarGr‘𝑁)) = dom ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}))
33 dmresi 6061 . . . . 5 dom ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}) = {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}
3432, 33eqtrdi 2817 . . . 4 (𝑁 ∈ ℕ0 → dom (iEdg‘(StarGr‘𝑁)) = {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}})
35 stgrvtx 49385 . . . . . 6 (𝑁 ∈ ℕ0 → (Vtx‘(StarGr‘𝑁)) = (0...𝑁))
3635pweqd 4576 . . . . 5 (𝑁 ∈ ℕ0 → 𝒫 (Vtx‘(StarGr‘𝑁)) = 𝒫 (0...𝑁))
3736rabeqdv 3430 . . . 4 (𝑁 ∈ ℕ0 → {𝑒 ∈ 𝒫 (Vtx‘(StarGr‘𝑁)) ∣ (♯‘𝑒) = 2} = {𝑒 ∈ 𝒫 (0...𝑁) ∣ (♯‘𝑒) = 2})
3831, 34, 37f1eq123d 6845 . . 3 (𝑁 ∈ ℕ0 → ((iEdg‘(StarGr‘𝑁)):dom (iEdg‘(StarGr‘𝑁))⟶1-1{𝑒 ∈ 𝒫 (Vtx‘(StarGr‘𝑁)) ∣ (♯‘𝑒) = 2} ↔ ( I ↾ {𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}):{𝑒 ∈ 𝒫 (0...𝑁) ∣ ∃𝑥 ∈ (1...𝑁)𝑒 = {0, 𝑥}}⟶1-1{𝑒 ∈ 𝒫 (0...𝑁) ∣ (♯‘𝑒) = 2}))
3930, 38mpbird 260 . 2 (𝑁 ∈ ℕ0 → (iEdg‘(StarGr‘𝑁)):dom (iEdg‘(StarGr‘𝑁))⟶1-1{𝑒 ∈ 𝒫 (Vtx‘(StarGr‘𝑁)) ∣ (♯‘𝑒) = 2})
40 fvex 6928 . . 3 (StarGr‘𝑁) ∈ V
41 eqid 2766 . . . 4 (Vtx‘(StarGr‘𝑁)) = (Vtx‘(StarGr‘𝑁))
42 eqid 2766 . . . 4 (iEdg‘(StarGr‘𝑁)) = (iEdg‘(StarGr‘𝑁))
4341, 42isusgrs 29796 . . 3 ((StarGr‘𝑁) ∈ V → ((StarGr‘𝑁) ∈ USGraph ↔ (iEdg‘(StarGr‘𝑁)):dom (iEdg‘(StarGr‘𝑁))⟶1-1{𝑒 ∈ 𝒫 (Vtx‘(StarGr‘𝑁)) ∣ (♯‘𝑒) = 2}))
4440, 43mp1i 14 . 2 (𝑁 ∈ ℕ0 → ((StarGr‘𝑁) ∈ USGraph ↔ (iEdg‘(StarGr‘𝑁)):dom (iEdg‘(StarGr‘𝑁))⟶1-1{𝑒 ∈ 𝒫 (Vtx‘(StarGr‘𝑁)) ∣ (♯‘𝑒) = 2}))
4539, 44mpbird 260 1 (𝑁 ∈ ℕ0 → (StarGr‘𝑁) ∈ USGraph)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  ∃wrex 3093  {crab 3415  Vcvv 3453   ⊆ wss 3899  𝒫 cpw 4559  {cpr 4589   I cid 5551  dom cdm 5657   ↾ cres 5659  ⟶1-1wf1 6562  ⟶1-1ontowf1o 6564  ‘cfv 6565  (class class class)co 7450  0cc0 11238  1c1 11239  2c2 12436  ℕ0cn0 12645  ...cfz 13678  ♯chash 14514  Vtxcvtx 29633  iEdgciedg 29634  USGraphcusgr 29789  StarGrcstgr 49382
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-oadd 8517  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-dju 10018  df-card 10056  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-xnn0 12719  df-z 12733  df-dec 12854  df-uz 13005  df-fz 13679  df-hash 14515  df-struct 17371  df-slot 17406  df-ndx 17418  df-base 17434  df-edgf 29626  df-vtx 29635  df-iedg 29636  df-usgr 29791  df-stgr 49383
This theorem is used by:  isubgr3stgrlem8  49404  isubgr3stgr  49406
  Copyright terms: Public domain W3C validator