| 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 13386 | . . . 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 4363 | . . . . 5 ⊢ (((Base‘ndx) ∈ ℕ ∧ 𝑉 ∈ 𝑋) → 〈(Base‘ndx), 𝑉〉 ∈ V) | |
| 10 | 1, 6, 9 | sylancr 418 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 〈(Base‘ndx), 𝑉〉 ∈ V) |
| 11 | opexg 4363 | . . . . 5 ⊢ ((𝑆 ∈ ℕ ∧ 𝐸 ∈ 𝑌) → 〈𝑆, 𝐸〉 ∈ V) | |
| 12 | 4, 7, 11 | sylancr 418 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 〈𝑆, 𝐸〉 ∈ V) |
| 13 | prexg 4344 | . . . 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 9292 | . . . 4 ⊢ (Base‘ndx) ∈ ℝ |
| 17 | structvtxvallem.b | . . . 4 ⊢ (Base‘ndx) < 𝑆 | |
| 18 | 16, 17 | ltneii 8412 | . . 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 11274 | 1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → 2o ≼ dom 𝐺) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 Vcvv 2821 ⊆ wss 3220 {cpr 3706 〈cop 3708 class class class wbr 4125 dom cdm 4769 ‘cfv 5372 2oc2o 6671 ≼ cdom 7011 < clt 8350 ℕcn 9283 ndxcnx 13327 Basecbs 13330 |
| 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 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 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1re 8263 ax-addrcl 8266 ax-pre-ltirr 8281 |
| This theorem 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 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-iord 4506 df-on 4508 df-suc 4511 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-1o 6677 df-2o 6678 df-en 7013 df-dom 7014 df-pnf 8352 df-mnf 8353 df-ltxr 8355 df-inn 9284 df-ndx 13333 df-slot 13334 df-base 13336 |
| This theorem is referenced by: structvtxval 16194 structiedg0val 16195 |
| Copyright terms: Public domain | W3C validator |