| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > struct2slots2dom | GIF version | ||
| Description: There are at least two elements in an extensible structure with a base set and another slot. (Contributed by AV, 23-Sep-2020.) (Revised by AV, 12-Nov-2021.) |
| Ref | Expression |
|---|---|
| structvtxvallem.s | ⊢ 𝑆 ∈ ℕ |
| structvtxvallem.b | ⊢ (Base‘ndx) < 𝑆 |
| structvtxvallem.g | ⊢ 𝐺 = {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} |
| Ref | Expression |
|---|---|
| struct2slots2dom | ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 2o ≼ dom 𝐺) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | basendxnn 13103 | . . . 4 ⊢ (Base‘ndx) ∈ ℕ | |
| 2 | 1 | elexi 2812 | . . 3 ⊢ (Base‘ndx) ∈ V |
| 3 | 2 | a1i 9 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (Base‘ndx) ∈ V) |
| 4 | structvtxvallem.s | . . 3 ⊢ 𝑆 ∈ ℕ | |
| 5 | 4 | a1i 9 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 𝑆 ∈ ℕ) |
| 6 | simpl 109 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 𝑉 ∈ 𝑋) | |
| 7 | simpr 110 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 𝐸 ∈ 𝑌) | |
| 8 | structvtxvallem.g | . . 3 ⊢ 𝐺 = {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} | |
| 9 | opexg 4314 | . . . . 5 ⊢ (((Base‘ndx) ∈ ℕ ∧ 𝑉 ∈ 𝑋) → 〈(Base‘ndx), 𝑉〉 ∈ V) | |
| 10 | 1, 6, 9 | sylancr 414 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 〈(Base‘ndx), 𝑉〉 ∈ V) |
| 11 | opexg 4314 | . . . . 5 ⊢ ((𝑆 ∈ ℕ ∧ 𝐸 ∈ 𝑌) → 〈𝑆, 𝐸〉 ∈ V) | |
| 12 | 4, 7, 11 | sylancr 414 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 〈𝑆, 𝐸〉 ∈ V) |
| 13 | prexg 4295 | . . . 4 ⊢ ((〈(Base‘ndx), 𝑉〉 ∈ V ∧ 〈𝑆, 𝐸〉 ∈ V) → {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} ∈ V) | |
| 14 | 10, 12, 13 | syl2anc 411 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} ∈ V) |
| 15 | 8, 14 | eqeltrid 2316 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 𝐺 ∈ V) |
| 16 | 1 | nnrei 9130 | . . . 4 ⊢ (Base‘ndx) ∈ ℝ |
| 17 | structvtxvallem.b | . . . 4 ⊢ (Base‘ndx) < 𝑆 | |
| 18 | 16, 17 | ltneii 8254 | . . 3 ⊢ (Base‘ndx) ≠ 𝑆 |
| 19 | 18 | a1i 9 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (Base‘ndx) ≠ 𝑆) |
| 20 | 8 | eqimss2i 3281 | . . 3 ⊢ {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} ⊆ 𝐺 |
| 21 | 20 | a1i 9 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} ⊆ 𝐺) |
| 22 | 3, 5, 6, 7, 15, 19, 21 | hashdmprop2dom 11079 | 1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 2o ≼ dom 𝐺) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 Vcvv 2799 ⊆ wss 3197 {cpr 3667 〈cop 3669 class class class wbr 4083 dom cdm 4719 ‘cfv 5318 2oc2o 6562 ≼ cdom 6894 < clt 8192 ℕcn 9121 ndxcnx 13044 Basecbs 13047 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1re 8104 ax-addrcl 8107 ax-pre-ltirr 8122 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-iord 4457 df-on 4459 df-suc 4462 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-1o 6568 df-2o 6569 df-en 6896 df-dom 6897 df-pnf 8194 df-mnf 8195 df-ltxr 8197 df-inn 9122 df-ndx 13050 df-slot 13051 df-base 13053 |
| This theorem is referenced by: structvtxval 15855 structiedg0val 15856 |
| Copyright terms: Public domain | W3C validator |