Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > umgrislfupgr | Structured version Visualization version GIF version |
Description: A multigraph is a loop-free pseudograph. (Contributed by AV, 27-Jan-2021.) |
Ref | Expression |
---|---|
umgrislfupgr.v | ⊢ 𝑉 = (Vtx‘𝐺) |
umgrislfupgr.i | ⊢ 𝐼 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
umgrislfupgr | ⊢ (𝐺 ∈ UMGraph ↔ (𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | umgrupgr 25769 | . . 3 ⊢ (𝐺 ∈ UMGraph → 𝐺 ∈ UPGraph ) | |
2 | umgrislfupgr.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
3 | umgrislfupgr.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
4 | 2, 3 | umgrf 25764 | . . . 4 ⊢ (𝐺 ∈ UMGraph → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) |
5 | id 22 | . . . . 5 ⊢ (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) | |
6 | 2re 10967 | . . . . . . . . . . 11 ⊢ 2 ∈ ℝ | |
7 | 6 | leidi 10441 | . . . . . . . . . 10 ⊢ 2 ≤ 2 |
8 | 7 | a1i 11 | . . . . . . . . 9 ⊢ ((#‘𝑥) = 2 → 2 ≤ 2) |
9 | breq2 4587 | . . . . . . . . 9 ⊢ ((#‘𝑥) = 2 → (2 ≤ (#‘𝑥) ↔ 2 ≤ 2)) | |
10 | 8, 9 | mpbird 246 | . . . . . . . 8 ⊢ ((#‘𝑥) = 2 → 2 ≤ (#‘𝑥)) |
11 | 10 | a1i 11 | . . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑉 → ((#‘𝑥) = 2 → 2 ≤ (#‘𝑥))) |
12 | 11 | ss2rabi 3647 | . . . . . 6 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)} |
13 | 12 | a1i 11 | . . . . 5 ⊢ (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) |
14 | 5, 13 | fssd 5970 | . . . 4 ⊢ (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) |
15 | 4, 14 | syl 17 | . . 3 ⊢ (𝐺 ∈ UMGraph → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) |
16 | 1, 15 | jca 553 | . 2 ⊢ (𝐺 ∈ UMGraph → (𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)})) |
17 | 2, 3 | upgrf 25753 | . . . 4 ⊢ (𝐺 ∈ UPGraph → 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2}) |
18 | fin 5998 | . . . . 5 ⊢ (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) ↔ (𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)})) | |
19 | umgrislfupgrlem 25788 | . . . . . 6 ⊢ ({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2} | |
20 | feq3 5941 | . . . . . 6 ⊢ (({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2} → (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})) | |
21 | 19, 20 | ax-mp 5 | . . . . 5 ⊢ (𝐼:dom 𝐼⟶({𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}) |
22 | 18, 21 | sylbb1 226 | . . . 4 ⊢ ((𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) ≤ 2} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}) |
23 | 17, 22 | sylan 487 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}) |
24 | 2, 3 | isumgr 25761 | . . . 4 ⊢ (𝐺 ∈ UPGraph → (𝐺 ∈ UMGraph ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})) |
25 | 24 | adantr 480 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → (𝐺 ∈ UMGraph ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})) |
26 | 23, 25 | mpbird 246 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)}) → 𝐺 ∈ UMGraph ) |
27 | 16, 26 | impbii 198 | 1 ⊢ (𝐺 ∈ UMGraph ↔ (𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (#‘𝑥)})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {crab 2900 ∖ cdif 3537 ∩ cin 3539 ⊆ wss 3540 ∅c0 3874 𝒫 cpw 4108 {csn 4125 class class class wbr 4583 dom cdm 5038 ⟶wf 5800 ‘cfv 5804 ≤ cle 9954 2c2 10947 #chash 12979 Vtxcvtx 25673 iEdgciedg 25674 UPGraph cupgr 25747 UMGraph cumgr 25748 |
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-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-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-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 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-fz 12198 df-hash 12980 df-upgr 25749 df-umgr 25750 |
This theorem is referenced by: vdumgr0 40695 vtxdumgrval 40701 umgrn1cycl 41010 |
Copyright terms: Public domain | W3C validator |