| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > usgrexmpl12ngric | Structured version Visualization version GIF version | ||
| Description: The graphs 𝐻 and 𝐺 are not isomorphic (𝐻 contains a triangle, see usgrexmpl1tri 48523, whereas 𝐺 does not, see usgrexmpl2trifr 48535. (Contributed by AV, 10-Aug-2025.) |
| Ref | Expression |
|---|---|
| usgrexmpl2.v | ⊢ 𝑉 = (0...5) |
| usgrexmpl2.e | ⊢ 𝐸 = 〈“{0, 1} {1, 2} {2, 3} {3, 4} {4, 5} {0, 3} {0, 5}”〉 |
| usgrexmpl2.g | ⊢ 𝐺 = 〈𝑉, 𝐸〉 |
| usgrexmpl1.k | ⊢ 𝐾 = 〈“{0, 1} {0, 2} {1, 2} {0, 3} {3, 4} {3, 5} {4, 5}”〉 |
| usgrexmpl1.h | ⊢ 𝐻 = 〈𝑉, 𝐾〉 |
| Ref | Expression |
|---|---|
| usgrexmpl12ngric | ⊢ ¬ 𝐺 ≃𝑔𝑟 𝐻 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgrexmpl2.v | . . . . . 6 ⊢ 𝑉 = (0...5) | |
| 2 | usgrexmpl2.e | . . . . . 6 ⊢ 𝐸 = 〈“{0, 1} {1, 2} {2, 3} {3, 4} {4, 5} {0, 3} {0, 5}”〉 | |
| 3 | usgrexmpl2.g | . . . . . 6 ⊢ 𝐺 = 〈𝑉, 𝐸〉 | |
| 4 | 1, 2, 3 | usgrexmpl2 48525 | . . . . 5 ⊢ 𝐺 ∈ USGraph |
| 5 | usgruhgr 29280 | . . . . 5 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UHGraph) | |
| 6 | 4, 5 | ax-mp 5 | . . . 4 ⊢ 𝐺 ∈ UHGraph |
| 7 | gricsym 48419 | . . . 4 ⊢ (𝐺 ∈ UHGraph → (𝐺 ≃𝑔𝑟 𝐻 → 𝐻 ≃𝑔𝑟 𝐺)) | |
| 8 | 6, 7 | ax-mp 5 | . . 3 ⊢ (𝐺 ≃𝑔𝑟 𝐻 → 𝐻 ≃𝑔𝑟 𝐺) |
| 9 | usgrexmpl1.k | . . . 4 ⊢ 𝐾 = 〈“{0, 1} {0, 2} {1, 2} {0, 3} {3, 4} {3, 5} {4, 5}”〉 | |
| 10 | usgrexmpl1.h | . . . 4 ⊢ 𝐻 = 〈𝑉, 𝐾〉 | |
| 11 | 1, 9, 10 | usgrexmpl1tri 48523 | . . 3 ⊢ {0, 1, 2} ∈ (GrTriangles‘𝐻) |
| 12 | brgric 48410 | . . . . 5 ⊢ (𝐻 ≃𝑔𝑟 𝐺 ↔ (𝐻 GraphIso 𝐺) ≠ ∅) | |
| 13 | n0 4288 | . . . . 5 ⊢ ((𝐻 GraphIso 𝐺) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (𝐻 GraphIso 𝐺)) | |
| 14 | 12, 13 | bitri 276 | . . . 4 ⊢ (𝐻 ≃𝑔𝑟 𝐺 ↔ ∃𝑓 𝑓 ∈ (𝐻 GraphIso 𝐺)) |
| 15 | 1, 2, 3 | usgrexmpl2trifr 48535 | . . . . . 6 ⊢ ¬ ∃𝑡 𝑡 ∈ (GrTriangles‘𝐺) |
| 16 | 1, 9, 10 | usgrexmpl1 48520 | . . . . . . . . . 10 ⊢ 𝐻 ∈ USGraph |
| 17 | usgruhgr 29280 | . . . . . . . . . 10 ⊢ (𝐻 ∈ USGraph → 𝐻 ∈ UHGraph) | |
| 18 | 16, 17 | ax-mp 5 | . . . . . . . . 9 ⊢ 𝐻 ∈ UHGraph |
| 19 | 18 | a1i 11 | . . . . . . . 8 ⊢ ((𝑓 ∈ (𝐻 GraphIso 𝐺) ∧ {0, 1, 2} ∈ (GrTriangles‘𝐻)) → 𝐻 ∈ UHGraph) |
| 20 | 6 | a1i 11 | . . . . . . . 8 ⊢ ((𝑓 ∈ (𝐻 GraphIso 𝐺) ∧ {0, 1, 2} ∈ (GrTriangles‘𝐻)) → 𝐺 ∈ UHGraph) |
| 21 | simpl 483 | . . . . . . . 8 ⊢ ((𝑓 ∈ (𝐻 GraphIso 𝐺) ∧ {0, 1, 2} ∈ (GrTriangles‘𝐻)) → 𝑓 ∈ (𝐻 GraphIso 𝐺)) | |
| 22 | simpr 485 | . . . . . . . 8 ⊢ ((𝑓 ∈ (𝐻 GraphIso 𝐺) ∧ {0, 1, 2} ∈ (GrTriangles‘𝐻)) → {0, 1, 2} ∈ (GrTriangles‘𝐻)) | |
| 23 | 19, 20, 21, 22 | grimgrtri 48447 | . . . . . . 7 ⊢ ((𝑓 ∈ (𝐻 GraphIso 𝐺) ∧ {0, 1, 2} ∈ (GrTriangles‘𝐻)) → (𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺)) |
| 24 | 23 | ex 413 | . . . . . 6 ⊢ (𝑓 ∈ (𝐻 GraphIso 𝐺) → ({0, 1, 2} ∈ (GrTriangles‘𝐻) → (𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺))) |
| 25 | alnex 1788 | . . . . . . 7 ⊢ (∀𝑡 ¬ 𝑡 ∈ (GrTriangles‘𝐺) ↔ ¬ ∃𝑡 𝑡 ∈ (GrTriangles‘𝐺)) | |
| 26 | vex 3436 | . . . . . . . . . 10 ⊢ 𝑓 ∈ V | |
| 27 | 26 | imaex 7861 | . . . . . . . . 9 ⊢ (𝑓 “ {0, 1, 2}) ∈ V |
| 28 | id 22 | . . . . . . . . . 10 ⊢ ((𝑓 “ {0, 1, 2}) ∈ V → (𝑓 “ {0, 1, 2}) ∈ V) | |
| 29 | eleq1 2828 | . . . . . . . . . . . 12 ⊢ (𝑡 = (𝑓 “ {0, 1, 2}) → (𝑡 ∈ (GrTriangles‘𝐺) ↔ (𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺))) | |
| 30 | 29 | notbid 319 | . . . . . . . . . . 11 ⊢ (𝑡 = (𝑓 “ {0, 1, 2}) → (¬ 𝑡 ∈ (GrTriangles‘𝐺) ↔ ¬ (𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺))) |
| 31 | 30 | adantl 482 | . . . . . . . . . 10 ⊢ (((𝑓 “ {0, 1, 2}) ∈ V ∧ 𝑡 = (𝑓 “ {0, 1, 2})) → (¬ 𝑡 ∈ (GrTriangles‘𝐺) ↔ ¬ (𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺))) |
| 32 | 28, 31 | spcdv 3539 | . . . . . . . . 9 ⊢ ((𝑓 “ {0, 1, 2}) ∈ V → (∀𝑡 ¬ 𝑡 ∈ (GrTriangles‘𝐺) → ¬ (𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺))) |
| 33 | 27, 32 | ax-mp 5 | . . . . . . . 8 ⊢ (∀𝑡 ¬ 𝑡 ∈ (GrTriangles‘𝐺) → ¬ (𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺)) |
| 34 | 33 | pm2.21d 121 | . . . . . . 7 ⊢ (∀𝑡 ¬ 𝑡 ∈ (GrTriangles‘𝐺) → ((𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺) → ¬ 𝐺 ≃𝑔𝑟 𝐻)) |
| 35 | 25, 34 | sylbir 236 | . . . . . 6 ⊢ (¬ ∃𝑡 𝑡 ∈ (GrTriangles‘𝐺) → ((𝑓 “ {0, 1, 2}) ∈ (GrTriangles‘𝐺) → ¬ 𝐺 ≃𝑔𝑟 𝐻)) |
| 36 | 15, 24, 35 | mpsylsyld 69 | . . . . 5 ⊢ (𝑓 ∈ (𝐻 GraphIso 𝐺) → ({0, 1, 2} ∈ (GrTriangles‘𝐻) → ¬ 𝐺 ≃𝑔𝑟 𝐻)) |
| 37 | 36 | exlimiv 1937 | . . . 4 ⊢ (∃𝑓 𝑓 ∈ (𝐻 GraphIso 𝐺) → ({0, 1, 2} ∈ (GrTriangles‘𝐻) → ¬ 𝐺 ≃𝑔𝑟 𝐻)) |
| 38 | 14, 37 | sylbi 218 | . . 3 ⊢ (𝐻 ≃𝑔𝑟 𝐺 → ({0, 1, 2} ∈ (GrTriangles‘𝐻) → ¬ 𝐺 ≃𝑔𝑟 𝐻)) |
| 39 | 8, 11, 38 | mpisyl 21 | . 2 ⊢ (𝐺 ≃𝑔𝑟 𝐻 → ¬ 𝐺 ≃𝑔𝑟 𝐻) |
| 40 | 39 | pm2.01i 190 | 1 ⊢ ¬ 𝐺 ≃𝑔𝑟 𝐻 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∀wal 1545 = wceq 1547 ∃wex 1786 ∈ wcel 2119 ≠ wne 2935 Vcvv 3432 ∅c0 4268 {cpr 4564 {ctp 4566 〈cop 4568 class class class wbr 5079 “ cima 5628 ‘cfv 6492 (class class class)co 7363 0cc0 11036 1c1 11037 2c2 12234 3c3 12235 4c4 12236 5c5 12237 ...cfz 13459 〈“cs7 14806 UHGraphcuhgr 29150 USGraphcusgr 29243 GraphIso cgrim 48373 ≃𝑔𝑟 cgric 48374 GrTrianglescgrtri 48435 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-tp 4567 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-3o 8404 df-oadd 8406 df-er 8640 df-map 8772 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-dju 9823 df-card 9861 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-3 12243 df-4 12244 df-5 12245 df-6 12246 df-7 12247 df-n0 12436 df-xnn0 12509 df-z 12523 df-uz 12787 df-fz 13460 df-fzo 13607 df-hash 14291 df-word 14474 df-concat 14531 df-s1 14557 df-s2 14808 df-s3 14809 df-s4 14810 df-s5 14811 df-s6 14812 df-s7 14813 df-vtx 29092 df-iedg 29093 df-edg 29142 df-uhgr 29152 df-upgr 29176 df-umgr 29177 df-uspgr 29244 df-usgr 29245 df-nbgr 29427 df-grim 48376 df-gric 48379 df-grtri 48436 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |