Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fsovcnvfvd Structured version   Visualization version   GIF version

Theorem fsovcnvfvd 45015
Description: The value of the converse of (𝐴𝑂𝐵), where 𝑂 is the operator which maps between maps from one base set to subsets of the second to maps from the second base set to subsets of the first for base sets, evaluated at function 𝐹. (Contributed by RP, 27-Apr-2021.)
Hypotheses
Ref Expression
fsovd.fs 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝑎) ↦ (𝑦 ∈ 𝑏 ↦ {𝑥 ∈ 𝑎 ∣ 𝑦 ∈ (𝑓‘𝑥)})))
fsovd.a (𝜑 → 𝐴 ∈ 𝑉)
fsovd.b (𝜑 → 𝐵 ∈ 𝑊)
fsovfvd.g 𝐺 = (𝐴𝑂𝐵)
fsovcnvfvd.f (𝜑 → 𝐹 ∈ (𝒫 𝐴 ↑m 𝐵))
Assertion
Ref Expression
fsovcnvfvd (𝜑 → (◡𝐺‘𝐹) = (𝑦 ∈ 𝐴 ↦ {𝑥 ∈ 𝐵 ∣ 𝑦 ∈ (𝐹‘𝑥)}))
Distinct variable groups:   𝐴,𝑎,𝑏,𝑓,𝑥,𝑦   𝐵,𝑎,𝑏,𝑓,𝑥,𝑦   𝑓,𝐹,𝑥,𝑦   𝜑,𝑎,𝑏,𝑓,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝐹(𝑎, 𝑏)   𝐺(𝑥, 𝑦, 𝑓, 𝑎, 𝑏)   𝑂(𝑥, 𝑦, 𝑓, 𝑎, 𝑏)   𝑉(𝑥, 𝑦, 𝑓, 𝑎, 𝑏)   𝑊(𝑥, 𝑦, 𝑓, 𝑎, 𝑏)

Proof of Theorem fsovcnvfvd
StepHypRef Expression
1 fsovd.fs . . . 4 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝑎) ↦ (𝑦 ∈ 𝑏 ↦ {𝑥 ∈ 𝑎 ∣ 𝑦 ∈ (𝑓‘𝑥)})))
2 fsovd.a . . . 4 (𝜑 → 𝐴 ∈ 𝑉)
3 fsovd.b . . . 4 (𝜑 → 𝐵 ∈ 𝑊)
4 fsovfvd.g . . . 4 𝐺 = (𝐴𝑂𝐵)
5 eqid 2760 . . . 4 (𝐵𝑂𝐴) = (𝐵𝑂𝐴)
61, 2, 3, 4, 5fsovcnvd 45014 . . 3 (𝜑 → ◡𝐺 = (𝐵𝑂𝐴))
76fveq1d 6887 . 2 (𝜑 → (◡𝐺‘𝐹) = ((𝐵𝑂𝐴)‘𝐹))
8 fsovcnvfvd.f . . 3 (𝜑 → 𝐹 ∈ (𝒫 𝐴 ↑m 𝐵))
91, 3, 2, 5, 8fsovfvd 45010 . 2 (𝜑 → ((𝐵𝑂𝐴)‘𝐹) = (𝑦 ∈ 𝐴 ↦ {𝑥 ∈ 𝐵 ∣ 𝑦 ∈ (𝐹‘𝑥)}))
107, 9eqtrd 2795 1 (𝜑 → (◡𝐺‘𝐹) = (𝑦 ∈ 𝐴 ↦ {𝑥 ∈ 𝐵 ∣ 𝑦 ∈ (𝐹‘𝑥)}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450  𝒫 cpw 4556   ↦ cmpt 5185  ◡ccnv 5649  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   ↑m cmap 8847
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-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
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-reu 3366  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 4584  df-pr 4586  df-op 4590  df-uni 4867  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 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8849
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator