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 35140
Description: The value of the preimage mapping operator can be restricted to preimages in the base set of the topology. Cf. orvcval 35137. (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 34936 . . . 4 (𝜑 → 𝑋 ∈ ∪ ran MblFnM)
32mbfmfun 34933 . . 3 (𝜑 → Fun 𝑋)
4 orvccel.1 . . . . . 6 (𝜑 → 𝑆 ∈ ∪ ran sigAlgebra)
5 orvccel.2 . . . . . . 7 (𝜑 → 𝐽 ∈ Top)
65sgsiga 34822 . . . . . 6 (𝜑 → (sigaGen‘𝐽) ∈ ∪ ran sigAlgebra)
74, 6, 1mbfmf 34934 . . . . 5 (𝜑 → 𝑋:∪ 𝑆⟶∪ (sigaGen‘𝐽))
8 elex 3471 . . . . . . 7 (𝐽 ∈ Top → 𝐽 ∈ V)
9 unisg 34823 . . . . . . 7 (𝐽 ∈ V → ∪ (sigaGen‘𝐽) = ∪ 𝐽)
105, 8, 93syl 19 . . . . . 6 (𝜑 → ∪ (sigaGen‘𝐽) = ∪ 𝐽)
1110feq3d 6695 . . . . 5 (𝜑 → (𝑋:∪ 𝑆⟶∪ (sigaGen‘𝐽) ↔ 𝑋:∪ 𝑆⟶∪ 𝐽))
127, 11mpbid 235 . . . 4 (𝜑 → 𝑋:∪ 𝑆⟶∪ 𝐽)
1312frnd 6719 . . 3 (𝜑 → ran 𝑋 ⊆ ∪ 𝐽)
14 fimacnvinrn2 7073 . . 3 ((Fun 𝑋 ∧ ran 𝑋 ⊆ ∪ 𝐽) → (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
153, 13, 14syl2anc 596 . 2 (𝜑 → (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
16 orvccel.4 . . 3 (𝜑 → 𝐴 ∈ 𝑉)
173, 1, 16orvcval 35137 . 2 (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}))
18 dfrab2 4265 . . . 4 {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} = ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)
1918a1i 11 . . 3 (𝜑 → {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴} = ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽))
2019imaeq2d 6051 . 2 (𝜑 → (◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}) = (◡𝑋 “ ({𝑦 ∣ 𝑦𝑅𝐴} ∩ ∪ 𝐽)))
2115, 17, 203eqtr4d 2805 1 (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∈ ∪ 𝐽 ∣ 𝑦𝑅𝐴}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {cab 2738  {crab 3412  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089  ∪ cuni 4866   class class class wbr 5102  ◡ccnv 5649  ran crn 5651   “ cima 5653  Fun wfun 6533  ⟶wf 6535  ‘cfv 6539  (class class class)co 7421  Topctop 23217  sigAlgebracsiga 34787  sigaGencsigagen 34818  MblFnMcmbfm 34929  ∘RV/𝑐corvc 35135
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-fo 6545  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1st 8002  df-2nd 8003  df-map 8853  df-siga 34788  df-sigagen 34819  df-mbfm 34930  df-orvc 35136
This theorem is used by:  orvcoel  35141  orvccel  35142  orrvcval4  35144
  Copyright terms: Public domain W3C validator