| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > umgrislfupgrdom | 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 |
|---|---|
| umgrislfupgrdom | ⊢ (𝐺 ∈ UMGraph ↔ (𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | umgrupgr 16036 | . . 3 ⊢ (𝐺 ∈ UMGraph → 𝐺 ∈ UPGraph) | |
| 2 | umgrislfupgr.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | umgrislfupgr.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 4 | 2, 3 | umgrfen 16031 | . . . 4 ⊢ (𝐺 ∈ UMGraph → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 5 | id 19 | . . . . 5 ⊢ (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) | |
| 6 | ensymb 6997 | . . . . . . . . 9 ⊢ (2o ≈ 𝑥 ↔ 𝑥 ≈ 2o) | |
| 7 | endom 6979 | . . . . . . . . 9 ⊢ (2o ≈ 𝑥 → 2o ≼ 𝑥) | |
| 8 | 6, 7 | sylbir 135 | . . . . . . . 8 ⊢ (𝑥 ≈ 2o → 2o ≼ 𝑥) |
| 9 | 8 | a1i 9 | . . . . . . 7 ⊢ (𝑥 ∈ 𝒫 𝑉 → (𝑥 ≈ 2o → 2o ≼ 𝑥)) |
| 10 | 9 | ss2rabi 3310 | . . . . . 6 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥} |
| 11 | 10 | a1i 9 | . . . . 5 ⊢ (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} → {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) |
| 12 | 5, 11 | fssd 5502 | . . . 4 ⊢ (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) |
| 13 | 4, 12 | syl 14 | . . 3 ⊢ (𝐺 ∈ UMGraph → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) |
| 14 | 1, 13 | jca 306 | . 2 ⊢ (𝐺 ∈ UMGraph → (𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})) |
| 15 | 2, 3 | upgrfen 16021 | . . . 4 ⊢ (𝐺 ∈ UPGraph → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)}) |
| 16 | fin 5531 | . . . . 5 ⊢ (𝐼:dom 𝐼⟶({𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) ↔ (𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})) | |
| 17 | umgrislfupgrenlem 16054 | . . . . . 6 ⊢ ({𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) = {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} | |
| 18 | feq3 5474 | . . . . . 6 ⊢ (({𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) = {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} → (𝐼:dom 𝐼⟶({𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o})) | |
| 19 | 17, 18 | ax-mp 5 | . . . . 5 ⊢ (𝐼:dom 𝐼⟶({𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∩ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 20 | 16, 19 | sylbb1 137 | . . . 4 ⊢ ((𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 21 | 15, 20 | sylan 283 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) → 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 22 | 2, 3 | isumgren 16029 | . . . 4 ⊢ (𝐺 ∈ UPGraph → (𝐺 ∈ UMGraph ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o})) |
| 23 | 22 | adantr 276 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) → (𝐺 ∈ UMGraph ↔ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o})) |
| 24 | 21, 23 | mpbird 167 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}) → 𝐺 ∈ UMGraph) |
| 25 | 14, 24 | impbii 126 | 1 ⊢ (𝐺 ∈ UMGraph ↔ (𝐺 ∈ UPGraph ∧ 𝐼:dom 𝐼⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 = wceq 1398 ∈ wcel 2202 {crab 2515 ∩ cin 3200 ⊆ wss 3201 𝒫 cpw 3656 class class class wbr 4093 dom cdm 4731 ⟶wf 5329 ‘cfv 5333 1oc1o 6618 2oc2o 6619 ≈ cen 6950 ≼ cdom 6951 Vtxcvtx 15936 iEdgciedg 15937 UPGraphcupgr 16015 UMGraphcumgr 16016 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-1o 6625 df-2o 6626 df-er 6745 df-en 6953 df-dom 6954 df-sub 8394 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-5 9247 df-6 9248 df-7 9249 df-8 9250 df-9 9251 df-n0 9445 df-dec 9656 df-ndx 13148 df-slot 13149 df-base 13151 df-edgf 15929 df-vtx 15938 df-iedg 15939 df-upgren 16017 df-umgren 16018 |
| This theorem is referenced by: vtxdumgrfival 16222 |
| Copyright terms: Public domain | W3C validator |