| 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 13408 | . . . 4 ⊢ (Base‘ndx) ∈ ℕ | |
| 2 | 1 | elexi 2834 | . . 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 4368 | . . . . 5 ⊢ (((Base‘ndx) ∈ ℕ ∧ 𝑉 ∈ 𝑋) → 〈(Base‘ndx), 𝑉〉 ∈ V) | |
| 10 | 1, 6, 9 | sylancr 418 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 〈(Base‘ndx), 𝑉〉 ∈ V) |
| 11 | opexg 4368 | . . . . 5 ⊢ ((𝑆 ∈ ℕ ∧ 𝐸 ∈ 𝑌) → 〈𝑆, 𝐸〉 ∈ V) | |
| 12 | 4, 7, 11 | sylancr 418 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 〈𝑆, 𝐸〉 ∈ V) |
| 13 | prexg 4349 | . . . 4 ⊢ ((〈(Base‘ndx), 𝑉〉 ∈ V ∧ 〈𝑆, 𝐸〉 ∈ V) → {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} ∈ V) | |
| 14 | 10, 12, 13 | syl2anc 415 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} ∈ V) |
| 15 | 8, 14 | eqeltrid 2325 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 𝐺 ∈ V) |
| 16 | 1 | nnrei 9313 | . . . 4 ⊢ (Base‘ndx) ∈ ℝ |
| 17 | structvtxvallem.b | . . . 4 ⊢ (Base‘ndx) < 𝑆 | |
| 18 | 16, 17 | ltneii 8422 | . . 3 ⊢ (Base‘ndx) ≠ 𝑆 |
| 19 | 18 | a1i 9 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (Base‘ndx) ≠ 𝑆) |
| 20 | 8 | eqimss2i 3305 | . . 3 ⊢ {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} ⊆ 𝐺 |
| 21 | 20 | a1i 9 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → {〈(Base‘ndx), 𝑉〉, 〈𝑆, 𝐸〉} ⊆ 𝐺) |
| 22 | 3, 5, 6, 7, 15, 19, 21 | hashdmprop2dom 11296 | 1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 2o ≼ dom 𝐺) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 Vcvv 2821 ⊆ wss 3220 {cpr 3710 〈cop 3712 class class class wbr 4130 dom cdm 4774 ‘cfv 5377 2oc2o 6681 ≼ cdom 7021 < clt 8360 ℕcn 9304 ndxcnx 13349 Basecbs 13352 |
| 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 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 ax-pre-ltirr 8291 |
| 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-nel 2516 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-suc 4516 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-1o 6687 df-2o 6688 df-en 7023 df-dom 7024 df-pnf 8362 df-mnf 8363 df-ltxr 8365 df-inn 9305 df-ndx 13355 df-slot 13356 df-base 13358 |
| This theorem is used by: structvtxval 16280 structiedg0val 16281 |
| Copyright terms: Public domain | W3C validator |