Theorem brovmptimex2 44869

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
brovmptimex2	⊢ (𝜑 → 𝐷 ∈ V)

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

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

Proof of Theorem brovmptimex2

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

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3450   class class class wbr 5103  (class class class)co 7413   ∈ cmpo 7415

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 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-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-dm 5665  df-iota 6489  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418

This theorem is used by:  ntrneibex  44913