Theorem orvcval 35201

Description: Value of the preimage mapping operator applied on a given random variable and constant. (Contributed by Thierry Arnoux, 19-Jan-2017.)

Hypotheses

Ref	Expression
orvcval.1	⊢ (𝜑 → Fun 𝑋)
orvcval.2	⊢ (𝜑 → 𝑋 ∈ 𝑉)
orvcval.3	⊢ (𝜑 → 𝐴 ∈ 𝑊)

Assertion

Ref	Expression
orvcval	⊢ (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}))

Distinct variable groups:   𝑦,𝐴   𝑦,𝑅   𝑦,𝑋

Allowed substitution hints:   𝜑(𝑦)   𝑉(𝑦)   𝑊(𝑦)

Proof of Theorem orvcval

Dummy variables 𝑥 𝑎 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-orvc 35200	. . 3 ⊢ ∘RV/𝑐𝑅 = (𝑥 ∈ {𝑥 ∣ Fun 𝑥}, 𝑎 ∈ V ↦ (◡𝑥 “ {𝑦 ∣ 𝑦𝑅𝑎}))
2	1	a1i 11	. 2 ⊢ (𝜑 → ∘RV/𝑐𝑅 = (𝑥 ∈ {𝑥 ∣ Fun 𝑥}, 𝑎 ∈ V ↦ (◡𝑥 “ {𝑦 ∣ 𝑦𝑅𝑎})))
3		simpl 488	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑎 = 𝐴) → 𝑥 = 𝑋)
4	3	cnveqd 5865	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑎 = 𝐴) → ◡𝑥 = ◡𝑋)
5		simpr 490	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑎 = 𝐴) → 𝑎 = 𝐴)
6	5	breq2d 5120	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑎 = 𝐴) → (𝑦𝑅𝑎 ↔ 𝑦𝑅𝐴))
7	6	abbidv 2829	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑎 = 𝐴) → {𝑦 ∣ 𝑦𝑅𝑎} = {𝑦 ∣ 𝑦𝑅𝐴})
8	4, 7	imaeq12d 6071	. . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑎 = 𝐴) → (◡𝑥 “ {𝑦 ∣ 𝑦𝑅𝑎}) = (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}))
9	8	adantl 487	. 2 ⊢ ((𝜑 ∧ (𝑥 = 𝑋 ∧ 𝑎 = 𝐴)) → (◡𝑥 “ {𝑦 ∣ 𝑦𝑅𝑎}) = (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}))
10		orvcval.2	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
11		orvcval.1	. . 3 ⊢ (𝜑 → Fun 𝑋)
12		funeq 6587	. . 3 ⊢ (𝑥 = 𝑋 → (Fun 𝑥 ↔ Fun 𝑋))
13	10, 11, 12	elabd 3638	. 2 ⊢ (𝜑 → 𝑋 ∈ {𝑥 ∣ Fun 𝑥})
14		orvcval.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑊)
15		elex 3475	. . 3 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ V)
16	14, 15	syl 18	. 2 ⊢ (𝜑 → 𝐴 ∈ V)
17		cnvexg 7970	. . 3 ⊢ (𝑋 ∈ 𝑉 → ◡𝑋 ∈ V)
18		imaexg 7959	. . 3 ⊢ (◡𝑋 ∈ V → (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}) ∈ V)
19	10, 17, 18	3syl 19	. 2 ⊢ (𝜑 → (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}) ∈ V)
20	2, 9, 13, 16, 19	ovmpod 7604	1 ⊢ (𝜑 → (𝑋∘RV/𝑐𝑅𝐴) = (◡𝑋 “ {𝑦 ∣ 𝑦𝑅𝐴}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  Vcvv 3454   class class class wbr 5108  ^◡ccnv 5657   “ cima 5661  Fun wfun 6560  (class class class)co 7451   ∈ cmpo 7453  ∘_RV/𝑐corvc 35199

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 5255  ax-pow 5334  ax-pr 5398  ax-un 7783

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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-orvc 35200

This theorem is used by:  orvcval2  35202  orvcval4  35204