Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > structgrssvtxlem | Structured version Visualization version GIF version |
Description: Lemma for structgrssvtx 27139 and structgrssiedg 27140. (Contributed by AV, 14-Oct-2020.) (Proof shortened by AV, 12-Nov-2021.) |
Ref | Expression |
---|---|
structgrssvtx.g | ⊢ (𝜑 → 𝐺 Struct 𝑋) |
structgrssvtx.v | ⊢ (𝜑 → 𝑉 ∈ 𝑌) |
structgrssvtx.e | ⊢ (𝜑 → 𝐸 ∈ 𝑍) |
structgrssvtx.s | ⊢ (𝜑 → {〈(Base‘ndx), 𝑉〉, 〈(.ef‘ndx), 𝐸〉} ⊆ 𝐺) |
Ref | Expression |
---|---|
structgrssvtxlem | ⊢ (𝜑 → 2 ≤ (♯‘dom 𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvexd 6750 | . 2 ⊢ (𝜑 → (Base‘ndx) ∈ V) | |
2 | fvexd 6750 | . 2 ⊢ (𝜑 → (.ef‘ndx) ∈ V) | |
3 | structgrssvtx.v | . 2 ⊢ (𝜑 → 𝑉 ∈ 𝑌) | |
4 | structgrssvtx.e | . 2 ⊢ (𝜑 → 𝐸 ∈ 𝑍) | |
5 | structgrssvtx.g | . . 3 ⊢ (𝜑 → 𝐺 Struct 𝑋) | |
6 | structex 16727 | . . 3 ⊢ (𝐺 Struct 𝑋 → 𝐺 ∈ V) | |
7 | 5, 6 | syl 17 | . 2 ⊢ (𝜑 → 𝐺 ∈ V) |
8 | slotsbaseefdif 27110 | . . 3 ⊢ (Base‘ndx) ≠ (.ef‘ndx) | |
9 | 8 | a1i 11 | . 2 ⊢ (𝜑 → (Base‘ndx) ≠ (.ef‘ndx)) |
10 | structgrssvtx.s | . 2 ⊢ (𝜑 → {〈(Base‘ndx), 𝑉〉, 〈(.ef‘ndx), 𝐸〉} ⊆ 𝐺) | |
11 | 1, 2, 3, 4, 7, 9, 10 | hashdmpropge2 14073 | 1 ⊢ (𝜑 → 2 ≤ (♯‘dom 𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2111 ≠ wne 2941 Vcvv 3420 ⊆ wss 3880 {cpr 4557 〈cop 4561 class class class wbr 5067 dom cdm 5565 ‘cfv 6397 ≤ cle 10892 2c2 11909 ♯chash 13920 Struct cstr 16723 ndxcnx 16768 Basecbs 16784 .efcedgf 27103 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2159 ax-12 2176 ax-ext 2709 ax-sep 5206 ax-nul 5213 ax-pow 5272 ax-pr 5336 ax-un 7541 ax-cnex 10809 ax-resscn 10810 ax-1cn 10811 ax-icn 10812 ax-addcl 10813 ax-addrcl 10814 ax-mulcl 10815 ax-mulrcl 10816 ax-mulcom 10817 ax-addass 10818 ax-mulass 10819 ax-distr 10820 ax-i2m1 10821 ax-1ne0 10822 ax-1rid 10823 ax-rnegex 10824 ax-rrecex 10825 ax-cnre 10826 ax-pre-lttri 10827 ax-pre-lttrn 10828 ax-pre-ltadd 10829 ax-pre-mulgt0 10830 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2072 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3067 df-rex 3068 df-reu 3069 df-rab 3071 df-v 3422 df-sbc 3709 df-csb 3826 df-dif 3883 df-un 3885 df-in 3887 df-ss 3897 df-pss 3899 df-nul 4252 df-if 4454 df-pw 4529 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4834 df-int 4874 df-iun 4920 df-br 5068 df-opab 5130 df-mpt 5150 df-tr 5176 df-id 5469 df-eprel 5474 df-po 5482 df-so 5483 df-fr 5523 df-we 5525 df-xp 5571 df-rel 5572 df-cnv 5573 df-co 5574 df-dm 5575 df-rn 5576 df-res 5577 df-ima 5578 df-pred 6175 df-ord 6233 df-on 6234 df-lim 6235 df-suc 6236 df-iota 6355 df-fun 6399 df-fn 6400 df-f 6401 df-f1 6402 df-fo 6403 df-f1o 6404 df-fv 6405 df-riota 7188 df-ov 7234 df-oprab 7235 df-mpo 7236 df-om 7663 df-1st 7779 df-2nd 7780 df-wrecs 8067 df-recs 8128 df-rdg 8166 df-1o 8222 df-oadd 8226 df-er 8411 df-en 8647 df-dom 8648 df-sdom 8649 df-fin 8650 df-dju 9541 df-card 9579 df-pnf 10893 df-mnf 10894 df-xr 10895 df-ltxr 10896 df-le 10897 df-sub 11088 df-neg 11089 df-nn 11855 df-2 11917 df-3 11918 df-4 11919 df-5 11920 df-6 11921 df-7 11922 df-8 11923 df-9 11924 df-n0 12115 df-xnn0 12187 df-z 12201 df-dec 12318 df-uz 12463 df-fz 13120 df-hash 13921 df-struct 16724 df-slot 16759 df-ndx 16769 df-base 16785 df-edgf 27104 |
This theorem is referenced by: structgrssvtx 27139 structgrssiedg 27140 |
Copyright terms: Public domain | W3C validator |