ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  qusval GIF version

Theorem qusval 13646
Description: Value of a quotient structure. (Contributed by Mario Carneiro, 23-Feb-2015.)
Hypotheses
Ref Expression
qusval.u (𝜑𝑈 = (𝑅 /s ))
qusval.v (𝜑𝑉 = (Base‘𝑅))
qusval.f 𝐹 = (𝑥𝑉 ↦ [𝑥] )
qusval.e (𝜑𝑊)
qusval.r (𝜑𝑅𝑍)
Assertion
Ref Expression
qusval (𝜑𝑈 = (𝐹s 𝑅))
Distinct variable groups:   𝑥,   𝜑,𝑥   𝑥,𝑅   𝑥,𝑉
Allowed substitution hints:   𝑈(𝑥)   𝐹(𝑥)   𝑊(𝑥)   𝑍(𝑥)

Proof of Theorem qusval
Dummy variables 𝑒 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 qusval.u . 2 (𝜑𝑈 = (𝑅 /s ))
2 df-qus 13627 . . . 4 /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟))
32a1i 9 . . 3 (𝜑 → /s = (𝑟 ∈ V, 𝑒 ∈ V ↦ ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟)))
4 simprl 535 . . . . . . . 8 ((𝜑 ∧ (𝑟 = 𝑅𝑒 = )) → 𝑟 = 𝑅)
54fveq2d 5699 . . . . . . 7 ((𝜑 ∧ (𝑟 = 𝑅𝑒 = )) → (Base‘𝑟) = (Base‘𝑅))
6 qusval.v . . . . . . . 8 (𝜑𝑉 = (Base‘𝑅))
76adantr 276 . . . . . . 7 ((𝜑 ∧ (𝑟 = 𝑅𝑒 = )) → 𝑉 = (Base‘𝑅))
85, 7eqtr4d 2274 . . . . . 6 ((𝜑 ∧ (𝑟 = 𝑅𝑒 = )) → (Base‘𝑟) = 𝑉)
9 eceq2 6844 . . . . . . 7 (𝑒 = → [𝑥]𝑒 = [𝑥] )
109ad2antll 495 . . . . . 6 ((𝜑 ∧ (𝑟 = 𝑅𝑒 = )) → [𝑥]𝑒 = [𝑥] )
118, 10mpteq12dv 4213 . . . . 5 ((𝜑 ∧ (𝑟 = 𝑅𝑒 = )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = (𝑥𝑉 ↦ [𝑥] ))
12 qusval.f . . . . 5 𝐹 = (𝑥𝑉 ↦ [𝑥] )
1311, 12eqtr4di 2289 . . . 4 ((𝜑 ∧ (𝑟 = 𝑅𝑒 = )) → (𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) = 𝐹)
1413, 4oveq12d 6103 . . 3 ((𝜑 ∧ (𝑟 = 𝑅𝑒 = )) → ((𝑥 ∈ (Base‘𝑟) ↦ [𝑥]𝑒) “s 𝑟) = (𝐹s 𝑅))
15 qusval.r . . . 4 (𝜑𝑅𝑍)
1615elexd 2835 . . 3 (𝜑𝑅 ∈ V)
17 qusval.e . . . 4 (𝜑𝑊)
1817elexd 2835 . . 3 (𝜑 ∈ V)
19 basfn 13413 . . . . . . . 8 Base Fn V
20 funfvex 5712 . . . . . . . . 9 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
2120funfni 5483 . . . . . . . 8 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
2219, 16, 21sylancr 418 . . . . . . 7 (𝜑 → (Base‘𝑅) ∈ V)
236, 22eqeltrd 2315 . . . . . 6 (𝜑𝑉 ∈ V)
2423mptexd 5944 . . . . 5 (𝜑 → (𝑥𝑉 ↦ [𝑥] ) ∈ V)
2512, 24eqeltrid 2325 . . . 4 (𝜑𝐹 ∈ V)
26 imasex 13628 . . . 4 ((𝐹 ∈ V ∧ 𝑅𝑍) → (𝐹s 𝑅) ∈ V)
2725, 15, 26syl2anc 415 . . 3 (𝜑 → (𝐹s 𝑅) ∈ V)
283, 14, 16, 18, 27ovmpod 6216 . 2 (𝜑 → (𝑅 /s ) = (𝐹s 𝑅))
291, 28eqtrd 2271 1 (𝜑𝑈 = (𝐹s 𝑅))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  Vcvv 2821  cmpt 4192   Fn wfn 5372  cfv 5377  (class class class)co 6085  cmpo 6087  [cec 6805  Basecbs 13354  s cimas 13624   /s cqus 13625
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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  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-ov 6088  df-oprab 6089  df-mpo 6090  df-ec 6809  df-inn 9306  df-2 9364  df-3 9365  df-ndx 13357  df-slot 13358  df-base 13360  df-plusg 13446  df-mulr 13447  df-iimas 13626  df-qus 13627
This theorem is used by:  qusin  13649  qusbas  13650  qusaddval  13658  qusaddf  13659  qusmulval  13660  qusmulf  13661  qusgrp2  13918  qusrng  14259  qusring2  14373
  Copyright terms: Public domain W3C validator