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 8887 | . . . . 5 ⊢ 𝐼 ∈ ℝ |
3 | 2 | leidi 8404 | . . . 4 ⊢ 𝐼 ≤ 𝐼 |
4 | 1, 1, 3 | 3pm3.2i 1170 | . . 3 ⊢ (𝐼 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝐼) |
5 | 4 | a1i 9 | . 2 ⊢ (𝑋 ∈ 𝑉 → (𝐼 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝐼)) |
6 | difss 3253 | . . 3 ⊢ ({〈𝐴, 𝑋〉} ∖ {∅}) ⊆ {〈𝐴, 𝑋〉} | |
7 | strle1.a | . . . . 5 ⊢ 𝐴 = 𝐼 | |
8 | 7, 1 | eqeltri 2243 | . . . 4 ⊢ 𝐴 ∈ ℕ |
9 | funsng 5244 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑋 ∈ 𝑉) → Fun {〈𝐴, 𝑋〉}) | |
10 | 8, 9 | mpan 422 | . . 3 ⊢ (𝑋 ∈ 𝑉 → Fun {〈𝐴, 𝑋〉}) |
11 | funss 5217 | . . 3 ⊢ (({〈𝐴, 𝑋〉} ∖ {∅}) ⊆ {〈𝐴, 𝑋〉} → (Fun {〈𝐴, 𝑋〉} → Fun ({〈𝐴, 𝑋〉} ∖ {∅}))) | |
12 | 6, 10, 11 | mpsyl 65 | . 2 ⊢ (𝑋 ∈ 𝑉 → Fun ({〈𝐴, 𝑋〉} ∖ {∅})) |
13 | opexg 4213 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑋 ∈ 𝑉) → 〈𝐴, 𝑋〉 ∈ V) | |
14 | 8, 13 | mpan 422 | . . 3 ⊢ (𝑋 ∈ 𝑉 → 〈𝐴, 𝑋〉 ∈ V) |
15 | snexg 4170 | . . 3 ⊢ (〈𝐴, 𝑋〉 ∈ V → {〈𝐴, 𝑋〉} ∈ V) | |
16 | 14, 15 | syl 14 | . 2 ⊢ (𝑋 ∈ 𝑉 → {〈𝐴, 𝑋〉} ∈ V) |
17 | dmsnopg 5082 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → dom {〈𝐴, 𝑋〉} = {𝐴}) | |
18 | 7 | sneqi 3595 | . . . . 5 ⊢ {𝐴} = {𝐼} |
19 | 1 | nnzi 9233 | . . . . . 6 ⊢ 𝐼 ∈ ℤ |
20 | fzsn 10022 | . . . . . 6 ⊢ (𝐼 ∈ ℤ → (𝐼...𝐼) = {𝐼}) | |
21 | 19, 20 | ax-mp 5 | . . . . 5 ⊢ (𝐼...𝐼) = {𝐼} |
22 | 18, 21 | eqtr4i 2194 | . . . 4 ⊢ {𝐴} = (𝐼...𝐼) |
23 | 17, 22 | eqtrdi 2219 | . . 3 ⊢ (𝑋 ∈ 𝑉 → dom {〈𝐴, 𝑋〉} = (𝐼...𝐼)) |
24 | eqimss 3201 | . . 3 ⊢ (dom {〈𝐴, 𝑋〉} = (𝐼...𝐼) → dom {〈𝐴, 𝑋〉} ⊆ (𝐼...𝐼)) | |
25 | 23, 24 | syl 14 | . 2 ⊢ (𝑋 ∈ 𝑉 → dom {〈𝐴, 𝑋〉} ⊆ (𝐼...𝐼)) |
26 | isstructr 12431 | . 2 ⊢ (((𝐼 ∈ ℕ ∧ 𝐼 ∈ ℕ ∧ 𝐼 ≤ 𝐼) ∧ (Fun ({〈𝐴, 𝑋〉} ∖ {∅}) ∧ {〈𝐴, 𝑋〉} ∈ V ∧ dom {〈𝐴, 𝑋〉} ⊆ (𝐼...𝐼))) → {〈𝐴, 𝑋〉} Struct 〈𝐼, 𝐼〉) | |
27 | 5, 12, 16, 25, 26 | syl13anc 1235 | 1 ⊢ (𝑋 ∈ 𝑉 → {〈𝐴, 𝑋〉} Struct 〈𝐼, 𝐼〉) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 973 = wceq 1348 ∈ wcel 2141 Vcvv 2730 ∖ cdif 3118 ⊆ wss 3121 ∅c0 3414 {csn 3583 〈cop 3586 class class class wbr 3989 dom cdm 4611 Fun wfun 5192 (class class class)co 5853 ≤ cle 7955 ℕcn 8878 ℤcz 9212 ...cfz 9965 Struct cstr 12412 |
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 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-addcom 7874 ax-addass 7876 ax-distr 7878 ax-i2m1 7879 ax-0lt1 7880 ax-0id 7882 ax-rnegex 7883 ax-cnre 7885 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-apti 7889 ax-pre-ltadd 7890 |
This theorem depends on definitions: df-bi 116 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rab 2457 df-v 2732 df-sbc 2956 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-br 3990 df-opab 4051 df-mpt 4052 df-id 4278 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-fv 5206 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 df-sub 8092 df-neg 8093 df-inn 8879 df-z 9213 df-uz 9488 df-fz 9966 df-struct 12418 |
This theorem is referenced by: strle2g 12509 strle3g 12510 1strstrg 12516 srngstrd 12540 lmodstrd 12551 |
Copyright terms: Public domain | W3C validator |