| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > usgruspgr | GIF version | ||
| Description: A simple graph is a simple pseudograph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 15-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgruspgr | ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2238 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | eqid 2238 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 1, 2 | isusgren 16604 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o})) |
| 4 | olc 723 | . . . . . . 7 ⊢ (𝑥 ≈ 2o → (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)) | |
| 5 | 4 | a1i 9 | . . . . . 6 ⊢ (𝑥 ∈ 𝒫 (Vtx‘𝐺) → (𝑥 ≈ 2o → (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o))) |
| 6 | 5 | ss2rabi 3330 | . . . . 5 ⊢ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o} ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)} |
| 7 | f1ss 5607 | . . . . 5 ⊢ (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o} ∧ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o} ⊆ {𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)}) | |
| 8 | 6, 7 | mpan2 429 | . . . 4 ⊢ ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ 𝑥 ≈ 2o} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)}) |
| 9 | 3, 8 | biimtrdi 163 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)})) |
| 10 | 1, 2 | isuspgren 16603 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ 𝒫 (Vtx‘𝐺) ∣ (𝑥 ≈ 1o ∨ 𝑥 ≈ 2o)})) |
| 11 | 9, 10 | sylibrd 169 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)) |
| 12 | 11 | pm2.43i 49 | 1 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 720 ∈ wcel 2209 {crab 2532 ⊆ wss 3220 𝒫 cpw 3688 class class class wbr 4131 dom cdm 4776 –1-1→wf1 5377 ‘cfv 5380 1oc1o 6684 2oc2o 6685 ≈ cen 7024 Vtxcvtx 16458 iEdgciedg 16459 USPGraphcuspgr 16599 USGraphcusgr 16600 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-sub 8506 df-inn 9314 df-2 9372 df-3 9373 df-4 9374 df-5 9375 df-6 9376 df-7 9377 df-8 9378 df-9 9379 df-n0 9575 df-dec 9789 df-ndx 13413 df-slot 13414 df-base 13416 df-edgf 16451 df-vtx 16460 df-iedg 16461 df-uspgren 16601 df-usgren 16602 |
| This theorem is used by: usgrumgruspgr 16631 usgruspgrben 16632 usgrupgr 16634 usgrislfuspgrdom 16636 usgredg2vtxeu 16665 usgredgedg 16673 usgredgdomord 16676 vtxdusgrfvedgfi 16748 |
| Copyright terms: Public domain | W3C validator |