Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > strle1g | GIF version |
Description: Make a structure from a singleton. (Contributed by Mario Carneiro, 29-Aug-2015.) (Revised by Jim Kingdon, 27-Jan-2023.) |
Ref | Expression |
---|---|
strle1.i | ⊢ 𝐼 ∈ ℕ |
strle1.a | ⊢ 𝐴 = 𝐼 |
Ref | Expression |
---|---|
strle1g | ⊢ (𝑋 ∈ 𝑉 → {〈𝐴, 𝑋〉} Struct 〈𝐼, 𝐼〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | strle1.i | . . . 4 ⊢ 𝐼 ∈ ℕ | |
2 | 1 | nnrei 8866 | . . . . 5 ⊢ 𝐼 ∈ ℝ |
3 | 2 | leidi 8383 | . . . 4 ⊢ 𝐼 ≤ 𝐼 |
4 | 1, 1, 3 | 3pm3.2i 1165 | . . 3 ⊢ (𝐼 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝐼) |
5 | 4 | a1i 9 | . 2 ⊢ (𝑋 ∈ 𝑉 → (𝐼 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝐼)) |
6 | difss 3248 | . . 3 ⊢ ({〈𝐴, 𝑋〉} ∖ {∅}) ⊆ {〈𝐴, 𝑋〉} | |
7 | strle1.a | . . . . 5 ⊢ 𝐴 = 𝐼 | |
8 | 7, 1 | eqeltri 2239 | . . . 4 ⊢ 𝐴 ∈ ℕ |
9 | funsng 5234 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑋 ∈ 𝑉) → Fun {〈𝐴, 𝑋〉}) | |
10 | 8, 9 | mpan 421 | . . 3 ⊢ (𝑋 ∈ 𝑉 → Fun {〈𝐴, 𝑋〉}) |
11 | funss 5207 | . . 3 ⊢ (({〈𝐴, 𝑋〉} ∖ {∅}) ⊆ {〈𝐴, 𝑋〉} → (Fun {〈𝐴, 𝑋〉} → Fun ({〈𝐴, 𝑋〉} ∖ {∅}))) | |
12 | 6, 10, 11 | mpsyl 65 | . 2 ⊢ (𝑋 ∈ 𝑉 → Fun ({〈𝐴, 𝑋〉} ∖ {∅})) |
13 | opexg 4206 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑋 ∈ 𝑉) → 〈𝐴, 𝑋〉 ∈ V) | |
14 | 8, 13 | mpan 421 | . . 3 ⊢ (𝑋 ∈ 𝑉 → 〈𝐴, 𝑋〉 ∈ V) |
15 | snexg 4163 | . . 3 ⊢ (〈𝐴, 𝑋〉 ∈ V → {〈𝐴, 𝑋〉} ∈ V) | |
16 | 14, 15 | syl 14 | . 2 ⊢ (𝑋 ∈ 𝑉 → {〈𝐴, 𝑋〉} ∈ V) |
17 | dmsnopg 5075 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → dom {〈𝐴, 𝑋〉} = {𝐴}) | |
18 | 7 | sneqi 3588 | . . . . 5 ⊢ {𝐴} = {𝐼} |
19 | 1 | nnzi 9212 | . . . . . 6 ⊢ 𝐼 ∈ ℤ |
20 | fzsn 10001 | . . . . . 6 ⊢ (𝐼 ∈ ℤ → (𝐼...𝐼) = {𝐼}) | |
21 | 19, 20 | ax-mp 5 | . . . . 5 ⊢ (𝐼...𝐼) = {𝐼} |
22 | 18, 21 | eqtr4i 2189 | . . . 4 ⊢ {𝐴} = (𝐼...𝐼) |
23 | 17, 22 | eqtrdi 2215 | . . 3 ⊢ (𝑋 ∈ 𝑉 → dom {〈𝐴, 𝑋〉} = (𝐼...𝐼)) |
24 | eqimss 3196 | . . 3 ⊢ (dom {〈𝐴, 𝑋〉} = (𝐼...𝐼) → dom {〈𝐴, 𝑋〉} ⊆ (𝐼...𝐼)) | |
25 | 23, 24 | syl 14 | . 2 ⊢ (𝑋 ∈ 𝑉 → dom {〈𝐴, 𝑋〉} ⊆ (𝐼...𝐼)) |
26 | isstructr 12409 | . 2 ⊢ (((𝐼 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝐼) ∧ (Fun ({〈𝐴, 𝑋〉} ∖ {∅}) ∧ {〈𝐴, 𝑋〉} ∈ V ∧ dom {〈𝐴, 𝑋〉} ⊆ (𝐼...𝐼))) → {〈𝐴, 𝑋〉} Struct 〈𝐼, 𝐼〉) | |
27 | 5, 12, 16, 25, 26 | syl13anc 1230 | 1 ⊢ (𝑋 ∈ 𝑉 → {〈𝐴, 𝑋〉} Struct 〈𝐼, 𝐼〉) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 968 = wceq 1343 ∈ wcel 2136 Vcvv 2726 ∖ cdif 3113 ⊆ wss 3116 ∅c0 3409 {csn 3576 〈cop 3579 class class class wbr 3982 dom cdm 4604 Fun wfun 5182 (class class class)co 5842 ≤ cle 7934 ℕcn 8857 ℤcz 9191 ...cfz 9944 Struct cstr 12390 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-addcom 7853 ax-addass 7855 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-0id 7861 ax-rnegex 7862 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-apti 7868 ax-pre-ltadd 7869 |
This theorem depends on definitions: df-bi 116 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rab 2453 df-v 2728 df-sbc 2952 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-int 3825 df-br 3983 df-opab 4044 df-mpt 4045 df-id 4271 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-iota 5153 df-fun 5190 df-fn 5191 df-f 5192 df-fv 5196 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-inn 8858 df-z 9192 df-uz 9467 df-fz 9945 df-struct 12396 |
This theorem is referenced by: strle2g 12486 strle3g 12487 1strstrg 12493 srngstrd 12517 lmodstrd 12528 |
Copyright terms: Public domain | W3C validator |