| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isuspgropen | GIF version | ||
| Description: The property of being an undirected simple pseudograph represented as an ordered pair. The representation as an ordered pair is the usual representation of a graph, see section I.1 of [Bollobas] p. 1. (Contributed by AV, 25-Nov-2021.) |
| Ref | Expression |
|---|---|
| isuspgropen | ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (〈𝑉, 𝐸〉 ∈ USPGraph ↔ 𝐸:dom 𝐸–1-1→{𝑝 ∈ 𝒫 𝑉 ∣ (𝑝 ≈ 1o ∨ 𝑝 ≈ 2o)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opexg 4320 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → 〈𝑉, 𝐸〉 ∈ V) | |
| 2 | eqid 2231 | . . . 4 ⊢ (Vtx‘〈𝑉, 𝐸〉) = (Vtx‘〈𝑉, 𝐸〉) | |
| 3 | eqid 2231 | . . . 4 ⊢ (iEdg‘〈𝑉, 𝐸〉) = (iEdg‘〈𝑉, 𝐸〉) | |
| 4 | 2, 3 | isuspgren 16035 | . . 3 ⊢ (〈𝑉, 𝐸〉 ∈ V → (〈𝑉, 𝐸〉 ∈ USPGraph ↔ (iEdg‘〈𝑉, 𝐸〉):dom (iEdg‘〈𝑉, 𝐸〉)–1-1→{𝑝 ∈ 𝒫 (Vtx‘〈𝑉, 𝐸〉) ∣ (𝑝 ≈ 1o ∨ 𝑝 ≈ 2o)})) |
| 5 | 1, 4 | syl 14 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (〈𝑉, 𝐸〉 ∈ USPGraph ↔ (iEdg‘〈𝑉, 𝐸〉):dom (iEdg‘〈𝑉, 𝐸〉)–1-1→{𝑝 ∈ 𝒫 (Vtx‘〈𝑉, 𝐸〉) ∣ (𝑝 ≈ 1o ∨ 𝑝 ≈ 2o)})) |
| 6 | opiedgfv 15903 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) | |
| 7 | 6 | dmeqd 4933 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → dom (iEdg‘〈𝑉, 𝐸〉) = dom 𝐸) |
| 8 | opvtxfv 15900 | . . . . 5 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) | |
| 9 | 8 | pweqd 3657 | . . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → 𝒫 (Vtx‘〈𝑉, 𝐸〉) = 𝒫 𝑉) |
| 10 | 9 | rabeqdv 2796 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → {𝑝 ∈ 𝒫 (Vtx‘〈𝑉, 𝐸〉) ∣ (𝑝 ≈ 1o ∨ 𝑝 ≈ 2o)} = {𝑝 ∈ 𝒫 𝑉 ∣ (𝑝 ≈ 1o ∨ 𝑝 ≈ 2o)}) |
| 11 | 6, 7, 10 | f1eq123d 5576 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → ((iEdg‘〈𝑉, 𝐸〉):dom (iEdg‘〈𝑉, 𝐸〉)–1-1→{𝑝 ∈ 𝒫 (Vtx‘〈𝑉, 𝐸〉) ∣ (𝑝 ≈ 1o ∨ 𝑝 ≈ 2o)} ↔ 𝐸:dom 𝐸–1-1→{𝑝 ∈ 𝒫 𝑉 ∣ (𝑝 ≈ 1o ∨ 𝑝 ≈ 2o)})) |
| 12 | 5, 11 | bitrd 188 | 1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (〈𝑉, 𝐸〉 ∈ USPGraph ↔ 𝐸:dom 𝐸–1-1→{𝑝 ∈ 𝒫 𝑉 ∣ (𝑝 ≈ 1o ∨ 𝑝 ≈ 2o)})) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 715 ∈ wcel 2202 {crab 2514 Vcvv 2802 𝒫 cpw 3652 〈cop 3672 class class class wbr 4088 dom cdm 4725 –1-1→wf1 5323 ‘cfv 5326 1oc1o 6578 2oc2o 6579 ≈ cen 6910 Vtxcvtx 15890 iEdgciedg 15891 USPGraphcuspgr 16031 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8126 ax-resscn 8127 ax-1cn 8128 ax-1re 8129 ax-icn 8130 ax-addcl 8131 ax-addrcl 8132 ax-mulcl 8133 ax-addcom 8135 ax-mulcom 8136 ax-addass 8137 ax-mulass 8138 ax-distr 8139 ax-i2m1 8140 ax-1rid 8142 ax-0id 8143 ax-rnegex 8144 ax-cnre 8146 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-fv 5334 df-riota 5974 df-ov 6024 df-oprab 6025 df-mpo 6026 df-1st 6306 df-2nd 6307 df-sub 8355 df-inn 9147 df-2 9205 df-3 9206 df-4 9207 df-5 9208 df-6 9209 df-7 9210 df-8 9211 df-9 9212 df-n0 9406 df-dec 9615 df-ndx 13106 df-slot 13107 df-base 13109 df-edgf 15883 df-vtx 15892 df-iedg 15893 df-uspgren 16033 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |