| 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 16068 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸) → ∃𝑎 ∈ 𝑉 ∃𝑐 ∈ 𝑉 𝐶 = {𝑎, 𝑐}) |
| 4 | 3 | 3adant3 1044 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ∃𝑎 ∈ 𝑉 ∃𝑐 ∈ 𝑉 𝐶 = {𝑎, 𝑐}) |
| 5 | elpr2elpr 3864 | . . . . . . 7 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉 ∧ 𝐴 ∈ {𝑎, 𝑐}) → ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏}) | |
| 6 | 5 | 3expia 1232 | . . . . . 6 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐴 ∈ {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏})) |
| 7 | eleq2 2295 | . . . . . . 7 ⊢ (𝐶 = {𝑎, 𝑐} → (𝐴 ∈ 𝐶 ↔ 𝐴 ∈ {𝑎, 𝑐})) | |
| 8 | eqeq1 2238 | . . . . . . . 8 ⊢ (𝐶 = {𝑎, 𝑐} → (𝐶 = {𝐴, 𝑏} ↔ {𝑎, 𝑐} = {𝐴, 𝑏})) | |
| 9 | 8 | rexbidv 2534 | . . . . . . 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 2658 | . 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 2202 ∃wrex 2512 {cpr 3674 ‘cfv 5333 Vtxcvtx 15936 Edgcedg 15981 UPGraphcupgr 16015 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-iord 4469 df-on 4471 df-suc 4474 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-1o 6625 df-2o 6626 df-en 6953 df-sub 8394 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-5 9247 df-6 9248 df-7 9249 df-8 9250 df-9 9251 df-n0 9445 df-dec 9656 df-ndx 13148 df-slot 13149 df-base 13151 df-edgf 15929 df-vtx 15938 df-iedg 15939 df-edg 15982 df-upgren 16017 |
| This theorem is referenced by: usgredg2vtx 16141 uspgredg2vtxeu 16142 |
| Copyright terms: Public domain | W3C validator |