Theorem brovpreldm 8083

Description: If a binary relation holds for the result of an operation, the operands are in the domain of the operation. (Contributed by AV, 31-Dec-2020.)

Assertion

Ref	Expression
brovpreldm	⊢ (𝐷(𝐵𝐴𝐶)𝐸 → ⟨𝐵, 𝐶⟩ ∈ dom 𝐴)

Proof of Theorem brovpreldm

Step	Hyp	Ref	Expression
1		df-br 5103	. 2 ⊢ (𝐷(𝐵𝐴𝐶)𝐸 ↔ ⟨𝐷, 𝐸⟩ ∈ (𝐵𝐴𝐶))
2		ne0i 4286	. . 3 ⊢ (⟨𝐷, 𝐸⟩ ∈ (𝐵𝐴𝐶) → (𝐵𝐴𝐶) ≠ ∅)
3		df-ov 7411	. . . . 5 ⊢ (𝐵𝐴𝐶) = (𝐴‘⟨𝐵, 𝐶⟩)
4		ndmfv 6905	. . . . 5 ⊢ (¬ ⟨𝐵, 𝐶⟩ ∈ dom 𝐴 → (𝐴‘⟨𝐵, 𝐶⟩) = ∅)
5	3, 4	eqtrid 2807	. . . 4 ⊢ (¬ ⟨𝐵, 𝐶⟩ ∈ dom 𝐴 → (𝐵𝐴𝐶) = ∅)
6	5	necon1ai 2982	. . 3 ⊢ ((𝐵𝐴𝐶) ≠ ∅ → ⟨𝐵, 𝐶⟩ ∈ dom 𝐴)
7	2, 6	syl 18	. 2 ⊢ (⟨𝐷, 𝐸⟩ ∈ (𝐵𝐴𝐶) → ⟨𝐵, 𝐶⟩ ∈ dom 𝐴)
8	1, 7	sylbi 220	1 ⊢ (𝐷(𝐵𝐴𝐶)𝐸 → ⟨𝐵, 𝐶⟩ ∈ dom 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∈ wcel 2145   ≠ wne 2955  ∅c0 4278  ⟨cop 4589   class class class wbr 5102  dom cdm 5647  ‘cfv 6527  (class class class)co 7408

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-ext 2732  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 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-dm 5657  df-iota 6483  df-fv 6535  df-ov 7411

This theorem is used by:  bropopvvv  8084  bropfvvvv  8086