Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  orvcval4 Structured version   Visualization version   GIF version

Theorem orvcval4 35086
Description: The value of the preimage mapping operator can be restricted to preimages in the base set of the topology. Cf. orvcval 35083. (Contributed by Thierry Arnoux, 21-Jan-2017.)
Hypotheses
Ref Expression
orvccel.1 (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra)
orvccel.2 (𝜑 → 𝐽 ∈ Top)
orvccel.3 (𝜑 → 𝑋 ∈ (𝑆MblFnM(sigaGen‘𝐽)))
orvccel.4 (𝜑 → 𝐴 ∈ 𝑉)
Assertion
Ref Expression
orvcval4 (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}))
Distinct variable groups:   𝑦,𝐴   𝑦,𝑅   𝑦,𝑋   𝑦,𝐽
Allowed substitution hints:   𝜑(𝑦)   𝑆(𝑦)   𝑉(𝑦)

Proof of Theorem orvcval4
StepHypRef Expression
1 orvccel.3 . . . . 5 (𝜑 → 𝑋 ∈ (𝑆MblFnM(sigaGen‘𝐽)))
21isanmbfm 34882 . . . 4 (𝜑 → 𝑋 ∈ ∪ ran MblFnM)
32mbfmfun 34879 . . 3 (𝜑 → Fun 𝑋)
4 orvccel.1 . . . . . 6 (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra)
5 orvccel.2 . . . . . . 7 (𝜑 → 𝐽 ∈ Top)
65sgsiga 34768 . . . . . 6 (𝜑 → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
74, 6, 1mbfmf 34880 . . . . 5 (𝜑 → 𝑋:∪ 𝑆⟶∪ (sigaGen‘𝐽))
8 elex 3472 . . . . . . 7 (𝐽 ∈ Top → 𝐽 ∈ V)
9 unisg 34769 . . . . . . 7 (𝐽 ∈ V → ∪ (sigaGen‘𝐽) = ∪ 𝐽)
105, 8, 93syl 19 . . . . . 6 (𝜑 → ∪ (sigaGen‘𝐽) = ∪ 𝐽)
1110feq3d 6692 . . . . 5 (𝜑 → (𝑋:∪ 𝑆⟶∪ (sigaGen‘𝐽) ↔ 𝑋:∪ 𝑆⟶∪ 𝐽))
127, 11mpbid 235 . . . 4 (𝜑 → 𝑋:∪ 𝑆⟶∪ 𝐽)
1312frnd 6716 . . 3 (𝜑 → ran 𝑋 ⊆ ∪ 𝐽)
14 fimacnvinrn2 7070 . . 3 ((Fun 𝑋 ∧ ran 𝑋 ⊆ ∪ 𝐽) → (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
153, 13, 14syl2anc 596 . 2 (𝜑 → (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
16 orvccel.4 . . 3 (𝜑 → 𝐴 ∈ 𝑉)
173, 1, 16orvcval 35083 . 2 (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}))
18 dfrab2 4266 . . . 4 {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} = ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)
1918a1i 11 . . 3 (𝜑 → {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} = ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽))
2019imaeq2d 6052 . 2 (𝜑 → (◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
2115, 17, 203eqtr4d 2806 1 (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {cab 2739  {crab 3413  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  ∪ cuni 4867   class class class wbr 5103  ◡ccnv 5650  ran crn 5652   “ cima 5654  Fun wfun 6531  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418  Topctop 23204  sigAlgebracsiga 34733  sigaGencsigagen 34764  MblFnMcmbfm 34875  ∘RV/𝑐corvc 35081
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-map 8842  df-siga 34734  df-sigagen 34765  df-mbfm 34876  df-orvc 35082
This theorem is used by:  orvcoel  35087  orvccel  35088  orrvcval4  35090
  Copyright terms: Public domain W3C validator