| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > uhgrm | GIF version | ||
| Description: An edge is an inhabited subset of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 15-Dec-2020.) |
| Ref | Expression |
|---|---|
| uhgrfun.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| uhgrm | ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → ∃𝑗 𝑗 ∈ (𝐸‘𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2206 | . . . . . . . 8 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | uhgrfun.e | . . . . . . . 8 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | 1, 2 | uhgrfm 15713 | . . . . . . 7 ⊢ (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶{𝑠 ∈ 𝒫 (Vtx‘𝐺) ∣ ∃𝑗 𝑗 ∈ 𝑠}) |
| 4 | fndm 5378 | . . . . . . . 8 ⊢ (𝐸 Fn 𝐴 → dom 𝐸 = 𝐴) | |
| 5 | 4 | feq2d 5419 | . . . . . . 7 ⊢ (𝐸 Fn 𝐴 → (𝐸:dom 𝐸⟶{𝑠 ∈ 𝒫 (Vtx‘𝐺) ∣ ∃𝑗 𝑗 ∈ 𝑠} ↔ 𝐸:𝐴⟶{𝑠 ∈ 𝒫 (Vtx‘𝐺) ∣ ∃𝑗 𝑗 ∈ 𝑠})) |
| 6 | 3, 5 | syl5ibcom 155 | . . . . . 6 ⊢ (𝐺 ∈ UHGraph → (𝐸 Fn 𝐴 → 𝐸:𝐴⟶{𝑠 ∈ 𝒫 (Vtx‘𝐺) ∣ ∃𝑗 𝑗 ∈ 𝑠})) |
| 7 | 6 | imp 124 | . . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑠 ∈ 𝒫 (Vtx‘𝐺) ∣ ∃𝑗 𝑗 ∈ 𝑠}) |
| 8 | 7 | ffvelcdmda 5722 | . . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ {𝑠 ∈ 𝒫 (Vtx‘𝐺) ∣ ∃𝑗 𝑗 ∈ 𝑠}) |
| 9 | 8 | 3impa 1197 | . . 3 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → (𝐸‘𝐹) ∈ {𝑠 ∈ 𝒫 (Vtx‘𝐺) ∣ ∃𝑗 𝑗 ∈ 𝑠}) |
| 10 | eleq2 2270 | . . . . 5 ⊢ (𝑠 = (𝐸‘𝐹) → (𝑗 ∈ 𝑠 ↔ 𝑗 ∈ (𝐸‘𝐹))) | |
| 11 | 10 | exbidv 1849 | . . . 4 ⊢ (𝑠 = (𝐸‘𝐹) → (∃𝑗 𝑗 ∈ 𝑠 ↔ ∃𝑗 𝑗 ∈ (𝐸‘𝐹))) |
| 12 | 11 | elrab 2930 | . . 3 ⊢ ((𝐸‘𝐹) ∈ {𝑠 ∈ 𝒫 (Vtx‘𝐺) ∣ ∃𝑗 𝑗 ∈ 𝑠} ↔ ((𝐸‘𝐹) ∈ 𝒫 (Vtx‘𝐺) ∧ ∃𝑗 𝑗 ∈ (𝐸‘𝐹))) |
| 13 | 9, 12 | sylib 122 | . 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → ((𝐸‘𝐹) ∈ 𝒫 (Vtx‘𝐺) ∧ ∃𝑗 𝑗 ∈ (𝐸‘𝐹))) |
| 14 | 13 | simprd 114 | 1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐸 Fn 𝐴 ∧ 𝐹 ∈ 𝐴) → ∃𝑗 𝑗 ∈ (𝐸‘𝐹)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∃wex 1516 ∈ wcel 2177 {crab 2489 𝒫 cpw 3617 dom cdm 4679 Fn wfn 5271 ⟶wf 5272 ‘cfv 5276 Vtxcvtx 15655 iEdgciedg 15656 UHGraphcuhgr 15707 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-un 4484 ax-setind 4589 ax-cnex 8023 ax-resscn 8024 ax-1cn 8025 ax-1re 8026 ax-icn 8027 ax-addcl 8028 ax-addrcl 8029 ax-mulcl 8030 ax-addcom 8032 ax-mulcom 8033 ax-addass 8034 ax-mulass 8035 ax-distr 8036 ax-i2m1 8037 ax-1rid 8039 ax-0id 8040 ax-rnegex 8041 ax-cnre 8043 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3000 df-csb 3095 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-if 3573 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-int 3888 df-br 4048 df-opab 4110 df-mpt 4111 df-id 4344 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-res 4691 df-iota 5237 df-fun 5278 df-fn 5279 df-f 5280 df-fo 5282 df-fv 5284 df-riota 5906 df-ov 5954 df-oprab 5955 df-mpo 5956 df-1st 6233 df-2nd 6234 df-sub 8252 df-inn 9044 df-2 9102 df-3 9103 df-4 9104 df-5 9105 df-6 9106 df-7 9107 df-8 9108 df-9 9109 df-n0 9303 df-dec 9512 df-ndx 12879 df-slot 12880 df-base 12882 df-edgf 15648 df-vtx 15657 df-iedg 15658 df-uhgrm 15709 |
| This theorem is referenced by: lpvtx 15719 |
| Copyright terms: Public domain | W3C validator |