| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > uspgr1eopdc | GIF version | ||
| Description: A simple pseudograph with (at least) two vertices and one edge. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 16-Oct-2020.) |
| Ref | Expression |
|---|---|
| uspgr1eopdc.v | ⊢ (𝜑 → 𝑉 ∈ 𝑊) |
| uspgr1eopdc.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| uspgr1eopdc.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| uspgr1eopdc.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
| uspgr1eopdc.dc | ⊢ (𝜑 → DECID 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| uspgr1eopdc | ⊢ (𝜑 → 〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉 ∈ USPGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2234 | . 2 ⊢ (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) | |
| 2 | uspgr1eopdc.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 3 | uspgr1eopdc.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 4 | uspgr1eopdc.v | . . . 4 ⊢ (𝜑 → 𝑉 ∈ 𝑊) | |
| 5 | uspgr1eopdc.c | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
| 6 | prexg 4331 | . . . . . . 7 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → {𝐵, 𝐶} ∈ V) | |
| 7 | 3, 5, 6 | syl2anc 411 | . . . . . 6 ⊢ (𝜑 → {𝐵, 𝐶} ∈ V) |
| 8 | opexg 4350 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ {𝐵, 𝐶} ∈ V) → 〈𝐴, {𝐵, 𝐶}〉 ∈ V) | |
| 9 | 2, 7, 8 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → 〈𝐴, {𝐵, 𝐶}〉 ∈ V) |
| 10 | snexg 4303 | . . . . 5 ⊢ (〈𝐴, {𝐵, 𝐶}〉 ∈ V → {〈𝐴, {𝐵, 𝐶}〉} ∈ V) | |
| 11 | 9, 10 | syl 14 | . . . 4 ⊢ (𝜑 → {〈𝐴, {𝐵, 𝐶}〉} ∈ V) |
| 12 | opvtxfv 16149 | . . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ {〈𝐴, {𝐵, 𝐶}〉} ∈ V) → (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = 𝑉) | |
| 13 | 4, 11, 12 | syl2anc 411 | . . 3 ⊢ (𝜑 → (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = 𝑉) |
| 14 | 3, 13 | eleqtrrd 2314 | . 2 ⊢ (𝜑 → 𝐵 ∈ (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉)) |
| 15 | 5, 13 | eleqtrrd 2314 | . 2 ⊢ (𝜑 → 𝐶 ∈ (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉)) |
| 16 | opiedgfv 16152 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ {〈𝐴, {𝐵, 𝐶}〉} ∈ V) → (iEdg‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = {〈𝐴, {𝐵, 𝐶}〉}) | |
| 17 | 4, 11, 16 | syl2anc 411 | . 2 ⊢ (𝜑 → (iEdg‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = {〈𝐴, {𝐵, 𝐶}〉}) |
| 18 | uspgr1eopdc.dc | . 2 ⊢ (𝜑 → DECID 𝐵 = 𝐶) | |
| 19 | 1, 2, 14, 15, 17, 18 | uspgr1edc 16367 | 1 ⊢ (𝜑 → 〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉 ∈ USPGraph) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 DECID wdc 842 = wceq 1398 ∈ wcel 2205 Vcvv 2815 {csn 3695 {cpr 3696 〈cop 3698 ‘cfv 5359 Vtxcvtx 16139 iEdgciedg 16140 USPGraphcuspgr 16280 |
| 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-14 2208 ax-ext 2216 ax-sep 4234 ax-nul 4242 ax-pow 4293 ax-pr 4328 ax-un 4560 ax-setind 4666 ax-iinf 4717 ax-cnex 8236 ax-resscn 8237 ax-1cn 8238 ax-1re 8239 ax-icn 8240 ax-addcl 8241 ax-addrcl 8242 ax-mulcl 8243 ax-addcom 8245 ax-mulcom 8246 ax-addass 8247 ax-mulass 8248 ax-distr 8249 ax-i2m1 8250 ax-1rid 8252 ax-0id 8253 ax-rnegex 8254 ax-cnre 8256 |
| 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 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3626 df-pw 3677 df-sn 3701 df-pr 3702 df-op 3704 df-uni 3921 df-int 3956 df-br 4116 df-opab 4178 df-mpt 4179 df-tr 4215 df-id 4420 df-iord 4493 df-on 4495 df-suc 4498 df-iom 4720 df-xp 4762 df-rel 4763 df-cnv 4764 df-co 4765 df-dm 4766 df-rn 4767 df-res 4768 df-ima 4769 df-iota 5319 df-fun 5361 df-fn 5362 df-f 5363 df-f1 5364 df-fo 5365 df-f1o 5366 df-fv 5367 df-riota 6013 df-ov 6063 df-oprab 6064 df-mpo 6065 df-1st 6349 df-2nd 6350 df-1o 6662 df-2o 6663 df-er 6782 df-en 6991 df-sub 8465 df-inn 9260 df-2 9318 df-3 9319 df-4 9320 df-5 9321 df-6 9322 df-7 9323 df-8 9324 df-9 9325 df-n0 9519 df-dec 9733 df-ndx 13305 df-slot 13306 df-base 13308 df-edgf 16132 df-vtx 16141 df-iedg 16142 df-uspgren 16282 |
| This theorem is referenced by: uspgr1ewopdc 16371 |
| Copyright terms: Public domain | W3C validator |