| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > usgrss | GIF version | ||
| Description: An edge is a subset of vertices. (Contributed by Alexander van der Vekens, 19-Aug-2017.) (Revised by AV, 15-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgrf1o.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| usgrss.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| usgrss | ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸‘𝑋) ⊆ 𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrab2 3312 | . . 3 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} ⊆ 𝒫 𝑉 | |
| 2 | usgrss.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | usgrf1o.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 4 | 2, 3 | usgrfen 16038 | . . . . 5 ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 5 | f1f 5543 | . . . . 5 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} → 𝐸:dom 𝐸⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) | |
| 6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 7 | 6 | ffvelcdmda 5783 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 8 | 1, 7 | sselid 3225 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸‘𝑋) ∈ 𝒫 𝑉) |
| 9 | 8 | elpwid 3663 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸‘𝑋) ⊆ 𝑉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 {crab 2514 ⊆ wss 3200 𝒫 cpw 3652 class class class wbr 4088 dom cdm 4725 ⟶wf 5322 –1-1→wf1 5323 ‘cfv 5326 2oc2o 6579 ≈ cen 6910 Vtxcvtx 15890 iEdgciedg 15891 USGraphcusgr 16032 |
| 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-usgren 16034 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |