![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rusgrprc | Structured version Visualization version GIF version |
Description: The class of 0-regular simple graphs is a proper class. (Contributed by AV, 27-Dec-2020.) |
Ref | Expression |
---|---|
rusgrprc | ⊢ {𝑔 ∣ 𝑔 RegUSGraph 0} ∉ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rgrusgrprc 29625 | . 2 ⊢ {𝑔 ∈ USGraph ∣ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0} ∉ V | |
2 | vex 3492 | . . . . . . 7 ⊢ 𝑔 ∈ V | |
3 | 0xnn0 12631 | . . . . . . 7 ⊢ 0 ∈ ℕ0* | |
4 | eqid 2740 | . . . . . . . 8 ⊢ (Vtx‘𝑔) = (Vtx‘𝑔) | |
5 | eqid 2740 | . . . . . . . 8 ⊢ (VtxDeg‘𝑔) = (VtxDeg‘𝑔) | |
6 | 4, 5 | isrusgr0 29602 | . . . . . . 7 ⊢ ((𝑔 ∈ V ∧ 0 ∈ ℕ0*) → (𝑔 RegUSGraph 0 ↔ (𝑔 ∈ USGraph ∧ 0 ∈ ℕ0* ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0))) |
7 | 2, 3, 6 | mp2an 691 | . . . . . 6 ⊢ (𝑔 RegUSGraph 0 ↔ (𝑔 ∈ USGraph ∧ 0 ∈ ℕ0* ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0)) |
8 | 3ancomb 1099 | . . . . . 6 ⊢ ((𝑔 ∈ USGraph ∧ 0 ∈ ℕ0* ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0) ↔ (𝑔 ∈ USGraph ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0 ∧ 0 ∈ ℕ0*)) | |
9 | df-3an 1089 | . . . . . . 7 ⊢ ((𝑔 ∈ USGraph ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0 ∧ 0 ∈ ℕ0*) ↔ ((𝑔 ∈ USGraph ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0) ∧ 0 ∈ ℕ0*)) | |
10 | 3, 9 | mpbiran2 709 | . . . . . 6 ⊢ ((𝑔 ∈ USGraph ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0 ∧ 0 ∈ ℕ0*) ↔ (𝑔 ∈ USGraph ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0)) |
11 | 7, 8, 10 | 3bitri 297 | . . . . 5 ⊢ (𝑔 RegUSGraph 0 ↔ (𝑔 ∈ USGraph ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0)) |
12 | 11 | abbii 2812 | . . . 4 ⊢ {𝑔 ∣ 𝑔 RegUSGraph 0} = {𝑔 ∣ (𝑔 ∈ USGraph ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0)} |
13 | df-rab 3444 | . . . 4 ⊢ {𝑔 ∈ USGraph ∣ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0} = {𝑔 ∣ (𝑔 ∈ USGraph ∧ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0)} | |
14 | 12, 13 | eqtr4i 2771 | . . 3 ⊢ {𝑔 ∣ 𝑔 RegUSGraph 0} = {𝑔 ∈ USGraph ∣ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0} |
15 | neleq1 3058 | . . 3 ⊢ ({𝑔 ∣ 𝑔 RegUSGraph 0} = {𝑔 ∈ USGraph ∣ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0} → ({𝑔 ∣ 𝑔 RegUSGraph 0} ∉ V ↔ {𝑔 ∈ USGraph ∣ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0} ∉ V)) | |
16 | 14, 15 | ax-mp 5 | . 2 ⊢ ({𝑔 ∣ 𝑔 RegUSGraph 0} ∉ V ↔ {𝑔 ∈ USGraph ∣ ∀𝑣 ∈ (Vtx‘𝑔)((VtxDeg‘𝑔)‘𝑣) = 0} ∉ V) |
17 | 1, 16 | mpbir 231 | 1 ⊢ {𝑔 ∣ 𝑔 RegUSGraph 0} ∉ V |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 {cab 2717 ∉ wnel 3052 ∀wral 3067 {crab 3443 Vcvv 3488 class class class wbr 5166 ‘cfv 6573 0cc0 11184 ℕ0*cxnn0 12625 Vtxcvtx 29031 USGraphcusgr 29184 VtxDegcvtxdg 29501 RegUSGraph crusgr 29592 |
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-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-card 10008 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-n0 12554 df-xnn0 12626 df-z 12640 df-uz 12904 df-xadd 13176 df-fz 13568 df-hash 14380 df-iedg 29034 df-edg 29083 df-uhgr 29093 df-upgr 29117 df-uspgr 29185 df-usgr 29186 df-vtxdg 29502 df-rgr 29593 df-rusgr 29594 |
This theorem is referenced by: rgrprc 29627 |
Copyright terms: Public domain | W3C validator |