| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > upgredg2vtx | GIF version | ||
| Description: For a vertex incident to an edge there is another vertex incident to the edge in a pseudograph. (Contributed by AV, 18-Oct-2020.) (Revised by AV, 5-Dec-2020.) |
| Ref | Expression |
|---|---|
| upgredg.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| upgredg.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| upgredg2vtx | ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | upgredg.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | upgredg.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | 1, 2 | upgredg 16139 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸) → ∃𝑎 ∈ 𝑉 ∃𝑐 ∈ 𝑉 𝐶 = {𝑎, 𝑐}) |
| 4 | 3 | 3adant3 1044 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ∃𝑎 ∈ 𝑉 ∃𝑐 ∈ 𝑉 𝐶 = {𝑎, 𝑐}) |
| 5 | elpr2elpr 3880 | . . . . . . 7 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉 ∧ 𝐴 ∈ {𝑎, 𝑐}) → ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏}) | |
| 6 | 5 | 3expia 1232 | . . . . . 6 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐴 ∈ {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏})) |
| 7 | eleq2 2296 | . . . . . . 7 ⊢ (𝐶 = {𝑎, 𝑐} → (𝐴 ∈ 𝐶 ↔ 𝐴 ∈ {𝑎, 𝑐})) | |
| 8 | eqeq1 2239 | . . . . . . . 8 ⊢ (𝐶 = {𝑎, 𝑐} → (𝐶 = {𝐴, 𝑏} ↔ {𝑎, 𝑐} = {𝐴, 𝑏})) | |
| 9 | 8 | rexbidv 2543 | . . . . . . 7 ⊢ (𝐶 = {𝑎, 𝑐} → (∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏} ↔ ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏})) |
| 10 | 7, 9 | imbi12d 234 | . . . . . 6 ⊢ (𝐶 = {𝑎, 𝑐} → ((𝐴 ∈ 𝐶 → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏}) ↔ (𝐴 ∈ {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏}))) |
| 11 | 6, 10 | imbitrrid 156 | . . . . 5 ⊢ (𝐶 = {𝑎, 𝑐} → ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐴 ∈ 𝐶 → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏}))) |
| 12 | 11 | com13 80 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐶 = {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏}))) |
| 13 | 12 | 3ad2ant3 1047 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐶 = {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏}))) |
| 14 | 13 | rexlimdvv 2667 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → (∃𝑎 ∈ 𝑉 ∃𝑐 ∈ 𝑉 𝐶 = {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏})) |
| 15 | 4, 14 | mpd 13 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 ∃wrex 2521 {cpr 3690 ‘cfv 5352 Vtxcvtx 16007 Edgcedg 16052 UPGraphcupgr 16086 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-mulcom 8228 ax-addass 8229 ax-mulass 8230 ax-distr 8231 ax-i2m1 8232 ax-1rid 8234 ax-0id 8235 ax-rnegex 8236 ax-cnre 8238 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-if 3621 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-id 4414 df-iord 4487 df-on 4489 df-suc 4492 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-1o 6647 df-2o 6648 df-en 6976 df-sub 8446 df-inn 9238 df-2 9296 df-3 9297 df-4 9298 df-5 9299 df-6 9300 df-7 9301 df-8 9302 df-9 9303 df-n0 9497 df-dec 9710 df-ndx 13215 df-slot 13216 df-base 13218 df-edgf 16000 df-vtx 16009 df-iedg 16010 df-edg 16053 df-upgren 16088 |
| This theorem is referenced by: usgredg2vtx 16212 uspgredg2vtxeu 16213 |
| Copyright terms: Public domain | W3C validator |