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 35197
Description: The value of the preimage mapping operator can be restricted to preimages in the base set of the topology. Cf. orvcval 35194. (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 34993 . . . 4 (𝜑 → 𝑋 ∈ ∪ ran MblFnM)
32mbfmfun 34990 . . 3 (𝜑 → Fun 𝑋)
4 orvccel.1 . . . . . 6 (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra)
5 orvccel.2 . . . . . . 7 (𝜑 → 𝐽 ∈ Top)
65sgsiga 34879 . . . . . 6 (𝜑 → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
74, 6, 1mbfmf 34991 . . . . 5 (𝜑 → 𝑋:∪ 𝑆⟶∪ (sigaGen‘𝐽))
8 elex 3475 . . . . . . 7 (𝐽 ∈ Top → 𝐽 ∈ V)
9 unisg 34880 . . . . . . 7 (𝐽 ∈ V → ∪ (sigaGen‘𝐽) = ∪ 𝐽)
105, 8, 93syl 19 . . . . . 6 (𝜑 → ∪ (sigaGen‘𝐽) = ∪ 𝐽)
1110feq3d 6722 . . . . 5 (𝜑 → (𝑋:∪ 𝑆⟶∪ (sigaGen‘𝐽) ↔ 𝑋:∪ 𝑆⟶∪ 𝐽))
127, 11mpbid 235 . . . 4 (𝜑 → 𝑋:∪ 𝑆⟶∪ 𝐽)
1312frnd 6746 . . 3 (𝜑 → ran 𝑋 ⊆ ∪ 𝐽)
14 fimacnvinrn2 7102 . . 3 ((Fun 𝑋 ∧ ran 𝑋 ⊆ ∪ 𝐽) → (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
153, 13, 14syl2anc 596 . 2 (𝜑 → (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
16 orvccel.4 . . 3 (𝜑 → 𝐴 ∈ 𝑉)
173, 1, 16orvcval 35194 . 2 (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}))
18 dfrab2 4268 . . . 4 {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} = ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)
1918a1i 11 . . 3 (𝜑 → {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} = ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽))
2019imaeq2d 6068 . 2 (𝜑 → (◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
2115, 17, 203eqtr4d 2808 1 (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {cab 2741  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∪ cuni 4870   class class class wbr 5106  ◡ccnv 5655  ran crn 5657   “ cima 5659  Fun wfun 6558  ⟶wf 6560  ‘cfv 6564  (class class class)co 7449  Topctop 23255  sigAlgebracsiga 34844  sigaGencsigagen 34875  MblFnMcmbfm 34986  ∘RV/𝑐corvc 35192
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-fo 6570  df-fv 6572  df-ov 7452  df-oprab 7453  df-mpo 7454  df-1st 8033  df-2nd 8034  df-map 8885  df-siga 34845  df-sigagen 34876  df-mbfm 34987  df-orvc 35193
This theorem is used by:  orvcoel  35198  orvccel  35199  orrvcval4  35201
  Copyright terms: Public domain W3C validator