Theorem sprmpt2d 7588

Description: The extension of a binary relation which is the value of an operation given in maps-to notation. (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 20-Jun-2019.)

Hypotheses

Ref	Expression
sprmpt2d.1	⊢ 𝑀 = (𝑣 ∈ V, 𝑒 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒)})
sprmpt2d.2	⊢ ((𝜑 ∧ 𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝜒 ↔ 𝜓))
sprmpt2d.3	⊢ (𝜑 → (𝑉 ∈ V ∧ 𝐸 ∈ V))
sprmpt2d.4	⊢ (𝜑 → ∀𝑥∀𝑦(𝑥(𝑉𝑅𝐸)𝑦 → 𝜃))
sprmpt2d.5	⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜃} ∈ V)

Assertion

Ref	Expression
sprmpt2d	⊢ (𝜑 → (𝑉𝑀𝐸) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)})

Distinct variable groups:   𝑒,𝐸,𝑣,𝑥,𝑦   𝑅,𝑒,𝑣   𝑒,𝑉,𝑣,𝑥,𝑦   𝜑,𝑒,𝑣,𝑥,𝑦   𝜓,𝑒,𝑣

Allowed substitution hints:   𝜓(𝑥,𝑦)   𝜒(𝑥,𝑦,𝑣,𝑒)   𝜃(𝑥,𝑦,𝑣,𝑒)   𝑅(𝑥,𝑦)   𝑀(𝑥,𝑦,𝑣,𝑒)

Proof of Theorem sprmpt2d

Step	Hyp	Ref	Expression
1		sprmpt2d.1	. . 3 ⊢ 𝑀 = (𝑣 ∈ V, 𝑒 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒)})
2	1	a1i 11	. 2 ⊢ (𝜑 → 𝑀 = (𝑣 ∈ V, 𝑒 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒)}))
3		oveq12 6887	. . . . . 6 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝑣𝑅𝑒) = (𝑉𝑅𝐸))
4	3	breqd 4854	. . . . 5 ⊢ ((𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝑥(𝑣𝑅𝑒)𝑦 ↔ 𝑥(𝑉𝑅𝐸)𝑦))
5	4	adantl 474	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → (𝑥(𝑣𝑅𝑒)𝑦 ↔ 𝑥(𝑉𝑅𝐸)𝑦))
6		sprmpt2d.2	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 = 𝑉 ∧ 𝑒 = 𝐸) → (𝜒 ↔ 𝜓))
7	6	3expb 1150	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → (𝜒 ↔ 𝜓))
8	5, 7	anbi12d 625	. . 3 ⊢ ((𝜑 ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → ((𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒) ↔ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)))
9	8	opabbidv 4909	. 2 ⊢ ((𝜑 ∧ (𝑣 = 𝑉 ∧ 𝑒 = 𝐸)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑣𝑅𝑒)𝑦 ∧ 𝜒)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)})
10		sprmpt2d.3	. . 3 ⊢ (𝜑 → (𝑉 ∈ V ∧ 𝐸 ∈ V))
11	10	simpld 489	. 2 ⊢ (𝜑 → 𝑉 ∈ V)
12	10	simprd 490	. 2 ⊢ (𝜑 → 𝐸 ∈ V)
13		sprmpt2d.4	. . 3 ⊢ (𝜑 → ∀𝑥∀𝑦(𝑥(𝑉𝑅𝐸)𝑦 → 𝜃))
14		sprmpt2d.5	. . 3 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜃} ∈ V)
15		opabbrex 6929	. . 3 ⊢ ((∀𝑥∀𝑦(𝑥(𝑉𝑅𝐸)𝑦 → 𝜃) ∧ {⟨𝑥, 𝑦⟩ ∣ 𝜃} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)} ∈ V)
16	13, 14, 15	syl2anc 580	. 2 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)} ∈ V)
17	2, 9, 11, 12, 16	ovmpt2d 7022	1 ⊢ (𝜑 → (𝑉𝑀𝐸) = {⟨𝑥, 𝑦⟩ ∣ (𝑥(𝑉𝑅𝐸)𝑦 ∧ 𝜓)})

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 385   ∧ w3a 1108  ∀wal 1651   = wceq 1653   ∈ wcel 2157  Vcvv 3385   class class class wbr 4843  {copab 4905  (class class class)co 6878   ↦ cmpt2 6880

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777  ax-sep 4975  ax-nul 4983  ax-pr 5097

This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2591  df-eu 2609  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ral 3094  df-rex 3095  df-rab 3098  df-v 3387  df-sbc 3634  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4116  df-if 4278  df-sn 4369  df-pr 4371  df-op 4375  df-uni 4629  df-br 4844  df-opab 4906  df-id 5220  df-xp 5318  df-rel 5319  df-cnv 5320  df-co 5321  df-dm 5322  df-iota 6064  df-fun 6103  df-fv 6109  df-ov 6881  df-oprab 6882  df-mpt2 6883

This theorem is referenced by: (None)