![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > qusex | GIF version |
Description: Existence of a quotient structure. (Contributed by Jim Kingdon, 25-Apr-2025.) |
Ref | Expression |
---|---|
qusex | ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → (𝑅 /s ∼ ) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2771 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V) | |
2 | 1 | adantr 276 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → 𝑅 ∈ V) |
3 | elex 2771 | . . . 4 ⊢ ( ∼ ∈ 𝑊 → ∼ ∈ V) | |
4 | 3 | adantl 277 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → ∼ ∈ V) |
5 | basfn 12679 | . . . . . 6 ⊢ Base Fn V | |
6 | funfvex 5572 | . . . . . . 7 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
7 | 6 | funfni 5355 | . . . . . 6 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
8 | 5, 2, 7 | sylancr 414 | . . . . 5 ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → (Base‘𝑅) ∈ V) |
9 | 8 | mptexd 5786 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → (𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ ) ∈ V) |
10 | simpl 109 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → 𝑅 ∈ 𝑉) | |
11 | imasex 12891 | . . . 4 ⊢ (((𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ ) ∈ V ∧ 𝑅 ∈ 𝑉) → ((𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ ) “s 𝑅) ∈ V) | |
12 | 9, 10, 11 | syl2anc 411 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → ((𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ ) “s 𝑅) ∈ V) |
13 | fveq2 5555 | . . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅)) | |
14 | 13 | mpteq1d 4115 | . . . . 5 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = (𝑥 ∈ (Base‘𝑅) ↦ [𝑥]𝑒)) |
15 | id 19 | . . . . 5 ⊢ (𝑟 = 𝑅 → 𝑟 = 𝑅) | |
16 | 14, 15 | oveq12d 5937 | . . . 4 ⊢ (𝑟 = 𝑅 → ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟) = ((𝑥 ∈ (Base‘𝑅) ↦ [𝑥]𝑒) “s 𝑅)) |
17 | eceq2 6626 | . . . . . 6 ⊢ (𝑒 = ∼ → [𝑥]𝑒 = [𝑥] ∼ ) | |
18 | 17 | mpteq2dv 4121 | . . . . 5 ⊢ (𝑒 = ∼ → (𝑥 ∈ (Base‘𝑅) ↦ [𝑥]𝑒) = (𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ )) |
19 | 18 | oveq1d 5934 | . . . 4 ⊢ (𝑒 = ∼ → ((𝑥 ∈ (Base‘𝑅) ↦ [𝑥]𝑒) “s 𝑅) = ((𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ ) “s 𝑅)) |
20 | df-qus 12889 | . . . 4 ⊢ /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟)) | |
21 | 16, 19, 20 | ovmpog 6054 | . . 3 ⊢ ((𝑅 ∈ V ∧ ∼ ∈ V ∧ ((𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ ) “s 𝑅) ∈ V) → (𝑅 /s ∼ ) = ((𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ ) “s 𝑅)) |
22 | 2, 4, 12, 21 | syl3anc 1249 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → (𝑅 /s ∼ ) = ((𝑥 ∈ (Base‘𝑅) ↦ [𝑥] ∼ ) “s 𝑅)) |
23 | 22, 12 | eqeltrd 2270 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ ∼ ∈ 𝑊) → (𝑅 /s ∼ ) ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 Vcvv 2760 ↦ cmpt 4091 Fn wfn 5250 ‘cfv 5255 (class class class)co 5919 [cec 6587 Basecbs 12621 “s cimas 12885 /s cqus 12886 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-1re 7968 ax-addrcl 7971 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-tp 3627 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-ov 5922 df-oprab 5923 df-mpo 5924 df-ec 6591 df-inn 8985 df-2 9043 df-3 9044 df-ndx 12624 df-slot 12625 df-base 12627 df-plusg 12711 df-mulr 12712 df-iimas 12888 df-qus 12889 |
This theorem is referenced by: znval 14135 znle 14136 znbaslemnn 14138 |
Copyright terms: Public domain | W3C validator |