Theorem ndmaovcom 39934

Description: Any operation is commutative outside its domain, analogous to ndmovcom 6719. (Contributed by Alexander van der Vekens, 26-May-2017.)

Hypothesis

Ref	Expression
ndmaov.1	⊢ dom 𝐹 = (𝑆 × 𝑆)

Assertion

Ref	Expression
ndmaovcom	⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐴𝐹𝐵)) = ((𝐵𝐹𝐴)) )

Proof of Theorem ndmaovcom

Step	Hyp	Ref	Expression
1		opelxp 5070	. . . 4 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
2		ndmaov.1	. . . . . 6 ⊢ dom 𝐹 = (𝑆 × 𝑆)
3	2	eqcomi 2619	. . . . 5 ⊢ (𝑆 × 𝑆) = dom 𝐹
4	3	eleq2i 2680	. . . 4 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) ↔ ⟨𝐴, 𝐵⟩ ∈ dom 𝐹)
5	1, 4	bitr3i 265	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ↔ ⟨𝐴, 𝐵⟩ ∈ dom 𝐹)
6		ndmaov 39912	. . 3 ⊢ (¬ ⟨𝐴, 𝐵⟩ ∈ dom 𝐹 → ((𝐴𝐹𝐵)) = V)
7	5, 6	sylnbi 319	. 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐴𝐹𝐵)) = V)
8		ancom 465	. . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ↔ (𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆))
9		opelxp 5070	. . . 4 ⊢ (⟨𝐵, 𝐴⟩ ∈ (𝑆 × 𝑆) ↔ (𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆))
10	3	eleq2i 2680	. . . 4 ⊢ (⟨𝐵, 𝐴⟩ ∈ (𝑆 × 𝑆) ↔ ⟨𝐵, 𝐴⟩ ∈ dom 𝐹)
11	8, 9, 10	3bitr2i 287	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ↔ ⟨𝐵, 𝐴⟩ ∈ dom 𝐹)
12		ndmaov 39912	. . 3 ⊢ (¬ ⟨𝐵, 𝐴⟩ ∈ dom 𝐹 → ((𝐵𝐹𝐴)) = V)
13	11, 12	sylnbi 319	. 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐵𝐹𝐴)) = V)
14	7, 13	eqtr4d 2647	1 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐴𝐹𝐵)) = ((𝐵𝐹𝐴)) )

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  ⟨cop 4131   × cxp 5036  dom cdm 5038   ((caov 39844

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-opab 4644  df-xp 5044  df-fv 5812  df-dfat 39845  df-afv 39846  df-aov 39847

This theorem is referenced by: (None)