Theorem brovmptimex1 44812

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 44811	. 2 ⊢ (𝜑 → (𝐶 ∈ V ∧ 𝐷 ∈ V))
5	4	simpld 500	1 ⊢ (𝜑 → 𝐶 ∈ V)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  Vcvv 3457   class class class wbr 5111  (class class class)co 7419   ∈ cmpo 7421

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-dm 5673  df-iota 6496  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424

This theorem is used by: (None)