Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > snstriedgval | Structured version Visualization version GIF version |
Description: The set of indexed edges of a graph without edges represented as an extensible structure with vertices as base set and no indexed edges. See iedgvalsnop 25717 for the (degenerated) case where 𝑉 = (Base‘ndx). (Contributed by AV, 24-Sep-2020.) |
Ref | Expression |
---|---|
snstrvtxval.v | ⊢ 𝑉 ∈ V |
snstrvtxval.g | ⊢ 𝐺 = {〈(Base‘ndx), 𝑉〉} |
Ref | Expression |
---|---|
snstriedgval | ⊢ (𝑉 ≠ (Base‘ndx) → (iEdg‘𝐺) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | snstrvtxval.g | . . . 4 ⊢ 𝐺 = {〈(Base‘ndx), 𝑉〉} | |
2 | snex 4835 | . . . 4 ⊢ {〈(Base‘ndx), 𝑉〉} ∈ V | |
3 | 1, 2 | eqeltri 2684 | . . 3 ⊢ 𝐺 ∈ V |
4 | iedgval 25678 | . . 3 ⊢ (𝐺 ∈ V → (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))) | |
5 | 3, 4 | mp1i 13 | . 2 ⊢ (𝑉 ≠ (Base‘ndx) → (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))) |
6 | necom 2835 | . . . 4 ⊢ (𝑉 ≠ (Base‘ndx) ↔ (Base‘ndx) ≠ 𝑉) | |
7 | fvex 6113 | . . . . 5 ⊢ (Base‘ndx) ∈ V | |
8 | snstrvtxval.v | . . . . 5 ⊢ 𝑉 ∈ V | |
9 | 7, 8, 1 | funsndifnop 6321 | . . . 4 ⊢ ((Base‘ndx) ≠ 𝑉 → ¬ 𝐺 ∈ (V × V)) |
10 | 6, 9 | sylbi 206 | . . 3 ⊢ (𝑉 ≠ (Base‘ndx) → ¬ 𝐺 ∈ (V × V)) |
11 | 10 | iffalsed 4047 | . 2 ⊢ (𝑉 ≠ (Base‘ndx) → if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) = (.ef‘𝐺)) |
12 | 2 | a1i 11 | . . . . 5 ⊢ (𝐺 = {〈(Base‘ndx), 𝑉〉} → {〈(Base‘ndx), 𝑉〉} ∈ V) |
13 | 1, 12 | syl5eqel 2692 | . . . 4 ⊢ (𝐺 = {〈(Base‘ndx), 𝑉〉} → 𝐺 ∈ V) |
14 | edgfndxid 25670 | . . . 4 ⊢ (𝐺 ∈ V → (.ef‘𝐺) = (𝐺‘(.ef‘ndx))) | |
15 | 1, 13, 14 | mp2b 10 | . . 3 ⊢ (.ef‘𝐺) = (𝐺‘(.ef‘ndx)) |
16 | slotsbaseefdif 25672 | . . . . . . . 8 ⊢ (Base‘ndx) ≠ (.ef‘ndx) | |
17 | 16 | nesymi 2839 | . . . . . . 7 ⊢ ¬ (.ef‘ndx) = (Base‘ndx) |
18 | 17 | a1i 11 | . . . . . 6 ⊢ (𝑉 ≠ (Base‘ndx) → ¬ (.ef‘ndx) = (Base‘ndx)) |
19 | fvex 6113 | . . . . . . 7 ⊢ (.ef‘ndx) ∈ V | |
20 | 19 | elsn 4140 | . . . . . 6 ⊢ ((.ef‘ndx) ∈ {(Base‘ndx)} ↔ (.ef‘ndx) = (Base‘ndx)) |
21 | 18, 20 | sylnibr 318 | . . . . 5 ⊢ (𝑉 ≠ (Base‘ndx) → ¬ (.ef‘ndx) ∈ {(Base‘ndx)}) |
22 | 1 | dmeqi 5247 | . . . . . 6 ⊢ dom 𝐺 = dom {〈(Base‘ndx), 𝑉〉} |
23 | dmsnopg 5524 | . . . . . . 7 ⊢ (𝑉 ∈ V → dom {〈(Base‘ndx), 𝑉〉} = {(Base‘ndx)}) | |
24 | 8, 23 | mp1i 13 | . . . . . 6 ⊢ (𝑉 ≠ (Base‘ndx) → dom {〈(Base‘ndx), 𝑉〉} = {(Base‘ndx)}) |
25 | 22, 24 | syl5eq 2656 | . . . . 5 ⊢ (𝑉 ≠ (Base‘ndx) → dom 𝐺 = {(Base‘ndx)}) |
26 | 21, 25 | neleqtrrd 2710 | . . . 4 ⊢ (𝑉 ≠ (Base‘ndx) → ¬ (.ef‘ndx) ∈ dom 𝐺) |
27 | ndmfv 6128 | . . . 4 ⊢ (¬ (.ef‘ndx) ∈ dom 𝐺 → (𝐺‘(.ef‘ndx)) = ∅) | |
28 | 26, 27 | syl 17 | . . 3 ⊢ (𝑉 ≠ (Base‘ndx) → (𝐺‘(.ef‘ndx)) = ∅) |
29 | 15, 28 | syl5eq 2656 | . 2 ⊢ (𝑉 ≠ (Base‘ndx) → (.ef‘𝐺) = ∅) |
30 | 5, 11, 29 | 3eqtrd 2648 | 1 ⊢ (𝑉 ≠ (Base‘ndx) → (iEdg‘𝐺) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 Vcvv 3173 ∅c0 3874 ifcif 4036 {csn 4125 〈cop 4131 × cxp 5036 dom cdm 5038 ‘cfv 5804 2nd c2nd 7058 ndxcnx 15692 Basecbs 15695 .efcedgf 25667 iEdgciedg 25674 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-ndx 15698 df-slot 15699 df-base 15700 df-edgf 25668 df-iedg 25676 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |