Theorem ndmovg 7625

Description: The value of an operation outside its domain. (Contributed by NM, 28-Mar-2008.)

Assertion

Ref	Expression
ndmovg	⊢ ((dom 𝐹 = (𝑅 × 𝑆) ∧ ¬ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆)) → (𝐴𝐹𝐵) = ∅)

Proof of Theorem ndmovg

Step	Hyp	Ref	Expression
1		df-ov 7443	. 2 ⊢ (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2		eleq2 2853	. . . . . 6 ⊢ (dom 𝐹 = (𝑅 × 𝑆) → (⟨𝐴, 𝐵⟩ ∈ dom 𝐹 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑅 × 𝑆)))
3		opelxp 5691	. . . . . 6 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑅 × 𝑆) ↔ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆))
4	2, 3	bitrdi 290	. . . . 5 ⊢ (dom 𝐹 = (𝑅 × 𝑆) → (⟨𝐴, 𝐵⟩ ∈ dom 𝐹 ↔ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆)))
5	4	notbid 321	. . . 4 ⊢ (dom 𝐹 = (𝑅 × 𝑆) → (¬ ⟨𝐴, 𝐵⟩ ∈ dom 𝐹 ↔ ¬ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆)))
6		ndmfv 6937	. . . 4 ⊢ (¬ ⟨𝐴, 𝐵⟩ ∈ dom 𝐹 → (𝐹‘⟨𝐴, 𝐵⟩) = ∅)
7	5, 6	biimtrrdi 257	. . 3 ⊢ (dom 𝐹 = (𝑅 × 𝑆) → (¬ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) → (𝐹‘⟨𝐴, 𝐵⟩) = ∅))
8	7	imp 412	. 2 ⊢ ((dom 𝐹 = (𝑅 × 𝑆) ∧ ¬ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆)) → (𝐹‘⟨𝐴, 𝐵⟩) = ∅)
9	1, 8	eqtrid 2810	1 ⊢ ((dom 𝐹 = (𝑅 × 𝑆) ∧ ¬ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆)) → (𝐴𝐹𝐵) = ∅)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∅c0 4281  ⟨cop 4838   × cxp 5653  dom cdm 5655  ‘cfv 6555  (class class class)co 7440

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-xp 5661  df-dm 5665  df-iota 6509  df-fv 6563  df-ov 7443

This theorem is used by:  ndmov  7626  curry1val  8140  curry2val  8144  1div0  11999  repsundef  14947  cshnz  14968  mamufacex  22738  mavmulsolcl  22893  mavmul0g  22895  iscau2  25625  1div0apr  31096  rrxsphere  50063