| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgr1eop | Structured version Visualization version GIF version | ||
| Description: A simple graph with (at least) two different vertices and one edge. If the two vertices were not different, the edge would be a loop. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 18-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgr1eop | ⊢ (((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 ≠ 𝐶 → 〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉 ∈ USGraph)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . 3 ⊢ (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) | |
| 2 | simpllr 788 | . . 3 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ≠ 𝐶) → 𝐴 ∈ 𝑋) | |
| 3 | simplrl 789 | . . . 4 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ≠ 𝐶) → 𝐵 ∈ 𝑉) | |
| 4 | simpl 488 | . . . . . 6 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) → 𝑉 ∈ 𝑊) | |
| 5 | 4 | adantr 486 | . . . . 5 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝑉 ∈ 𝑊) |
| 6 | snex 5404 | . . . . . 6 ⊢ {〈𝐴, {𝐵, 𝐶}〉} ∈ V | |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ (𝐵 ≠ 𝐶 → {〈𝐴, {𝐵, 𝐶}〉} ∈ V) |
| 8 | opvtxfv 29639 | . . . . 5 ⊢ ((𝑉 ∈ 𝑊 ∧ {〈𝐴, {𝐵, 𝐶}〉} ∈ V) → (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = 𝑉) | |
| 9 | 5, 7, 8 | syl2an 608 | . . . 4 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ≠ 𝐶) → (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = 𝑉) |
| 10 | 3, 9 | eleqtrrd 2867 | . . 3 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ≠ 𝐶) → 𝐵 ∈ (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉)) |
| 11 | simprr 785 | . . . . 5 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
| 12 | 6 | a1i 11 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → {〈𝐴, {𝐵, 𝐶}〉} ∈ V) |
| 13 | 4, 12, 8 | syl2an 608 | . . . . 5 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = 𝑉) |
| 14 | 11, 13 | eleqtrrd 2867 | . . . 4 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉)) |
| 15 | 14 | adantr 486 | . . 3 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ≠ 𝐶) → 𝐶 ∈ (Vtx‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉)) |
| 16 | opiedgfv 29642 | . . . 4 ⊢ ((𝑉 ∈ 𝑊 ∧ {〈𝐴, {𝐵, 𝐶}〉} ∈ V) → (iEdg‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = {〈𝐴, {𝐵, 𝐶}〉}) | |
| 17 | 5, 7, 16 | syl2an 608 | . . 3 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ≠ 𝐶) → (iEdg‘〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉) = {〈𝐴, {𝐵, 𝐶}〉}) |
| 18 | simpr 490 | . . 3 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ≠ 𝐶) → 𝐵 ≠ 𝐶) | |
| 19 | 1, 2, 10, 15, 17, 18 | usgr1e 29883 | . 2 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) ∧ 𝐵 ≠ 𝐶) → 〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉 ∈ USGraph) |
| 20 | 19 | ex 418 | 1 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝐴 ∈ 𝑋) ∧ (𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐵 ≠ 𝐶 → 〈𝑉, {〈𝐴, {𝐵, 𝐶}〉}〉 ∈ USGraph)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 {csn 4588 {cpr 4590 〈cop 4840 ‘cfv 6566 Vtxcvtx 29631 iEdgciedg 29632 USGraphcusgr 29787 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-n0 12647 df-xnn0 12720 df-z 12734 df-uz 13006 df-fz 13680 df-hash 14516 df-vtx 29633 df-iedg 29634 df-edg 29683 df-uspgr 29788 df-usgr 29789 |
| This theorem is used by: usgr2v1e2w 29890 |
| Copyright terms: Public domain | W3C validator |