Theorem ndmaovrcl 41284

Description: Reverse closure law, in contrast to ndmovrcl 6820 where it is required that the operation's domain doesn't contain the empty set ( -. (/) e. S), no additional asumption is required. (Contributed by Alexander van der Vekens, 26-May-2017.)

Hypothesis

Ref	Expression
ndmaov.1	|- dom F = ( S X. S )

Assertion

Ref	Expression
ndmaovrcl	|- ( (( A F B)) e. S -> ( A e. S /\ B e. S ) )

Proof of Theorem ndmaovrcl

Step	Hyp	Ref	Expression
1		aovvdm 41265	. 2 |- ( (( A F B)) e. S -> <. A , B >. e. dom F )
2		opelxp 5146	. . . 4 |- ( <. A , B >. e. ( S X. S ) <-> ( A e. S /\ B e. S ) )
3	2	biimpi 206	. . 3 |- ( <. A , B >. e. ( S X. S ) -> ( A e. S /\ B e. S ) )
4		ndmaov.1	. . 3 |- dom F = ( S X. S )
5	3, 4	eleq2s 2719	. 2 |- ( <. A , B >. e. dom F -> ( A e. S /\ B e. S ) )
6	1, 5	syl 17	1 |- ( (( A F B)) e. S -> ( A e. S /\ B e. S ) )

Syntax hints:   -> wi 4   /\ wa 384   = wceq 1483   e. wcel 1990   <.cop 4183   X. cxp 5112   dom cdm 5114   ((caov 41195

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-opab 4713  df-xp 5120  df-fv 5896  df-dfat 41196  df-afv 41197  df-aov 41198

This theorem is referenced by: (None)