Theorem brovmptimex1 45071

Description: If a binary relation holds and the relation is the value of a binary operation built with maps-to, then the arguments to that operation are sets. (Contributed by RP, 22-May-2021.)

Hypotheses

Ref	Expression
brovmptimex.mpt	⊢ 𝐹 = (𝑥 ∈ 𝐸, 𝑦 ∈ 𝐺 ↦ 𝐻)
brovmptimex.br	⊢ (𝜑 → 𝐴𝑅𝐵)
brovmptimex.ov	⊢ (𝜑 → 𝑅 = (𝐶𝐹𝐷))

Assertion

Ref	Expression
brovmptimex1	⊢ (𝜑 → 𝐶 ∈ V)

Distinct variable groups:   𝑥,𝐸,𝑦   𝑦,𝐹

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)   𝐵(𝑥, 𝑦)   𝐶(𝑥, 𝑦)   𝐷(𝑥, 𝑦)   𝑅(𝑥, 𝑦)   𝐹(𝑥)   𝐺(𝑥, 𝑦)   𝐻(𝑥, 𝑦)

Proof of Theorem brovmptimex1

Step	Hyp	Ref	Expression
1		brovmptimex.mpt	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐸, 𝑦 ∈ 𝐺 ↦ 𝐻)
2		brovmptimex.br	. . 3 ⊢ (𝜑 → 𝐴𝑅𝐵)
3		brovmptimex.ov	. . 3 ⊢ (𝜑 → 𝑅 = (𝐶𝐹𝐷))
4	1, 2, 3	brovmptimex 45070	. 2 ⊢ (𝜑 → (𝐶 ∈ V ∧ 𝐷 ∈ V))
5	4	simpld 500	1 ⊢ (𝜑 → 𝐶 ∈ V)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450   class class class wbr 5102  (class class class)co 7420   ∈ cmpo 7422

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-pr 5390

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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-dm 5660  df-iota 6494  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425

This theorem is used by: (None)