Theorem ovn0dmfun 48953

Description: If a class operation value for two operands is not the empty set, then the operands are contained in the domain of the class, and the class restricted to the operands is a function, analogous to fvfundmfvn0 6925. (Contributed by AV, 27-Jan-2020.)

Assertion

Ref	Expression
ovn0dmfun	⊢ ((𝐴𝐹𝐵) ≠ ∅ → (⟨𝐴, 𝐵⟩ ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {⟨𝐴, 𝐵⟩})))

Proof of Theorem ovn0dmfun

Step	Hyp	Ref	Expression
1		df-ov 7419	. . 3 ⊢ (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2	1	neeq1i 3025	. 2 ⊢ ((𝐴𝐹𝐵) ≠ ∅ ↔ (𝐹‘⟨𝐴, 𝐵⟩) ≠ ∅)
3		fvfundmfvn0 6925	. 2 ⊢ ((𝐹‘⟨𝐴, 𝐵⟩) ≠ ∅ → (⟨𝐴, 𝐵⟩ ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {⟨𝐴, 𝐵⟩})))
4	2, 3	sylbi 220	1 ⊢ ((𝐴𝐹𝐵) ≠ ∅ → (⟨𝐴, 𝐵⟩ ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {⟨𝐴, 𝐵⟩})))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2146   ≠ wne 2961  ∅c0 4289  {csn 4592  ⟨cop 4598  dom cdm 5664   ↾ cres 5666  Fun wfun 6534  ‘cfv 6540  (class class class)co 7416

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-ext 2738  ax-sep 5260  ax-nul 5272  ax-pr 5407

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4491  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4876  df-br 5113  df-opab 5177  df-id 5559  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-res 5676  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7419

This theorem is used by: (None)