Theorem ndmaovrcl 47803

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

Hypothesis

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

Assertion

Ref	Expression
ndmaovrcl	⊢ ( ((𝐴𝐹𝐵)) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))

Proof of Theorem ndmaovrcl

Step	Hyp	Ref	Expression
1		aovvdm 47784	. 2 ⊢ ( ((𝐴𝐹𝐵)) ∈ 𝑆 → ⟨𝐴, 𝐵⟩ ∈ dom 𝐹)
2		opelxp 5685	. . . 4 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
3	2	biimpi 218	. . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
4		ndmaov.1	. . 3 ⊢ dom 𝐹 = (𝑆 × 𝑆)
5	3, 4	eleq2s 2882	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ dom 𝐹 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
6	1, 5	syl 17	1 ⊢ ( ((𝐴𝐹𝐵)) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1562   ∈ wcel 2144  ⟨cop 4590   × cxp 5647  dom cdm 5649   ((caov 47717

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-br 5103  df-opab 5165  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-res 5661  df-iota 6479  df-fun 6525  df-fv 6531  df-aiota 47684  df-dfat 47718  df-afv 47719  df-aov 47720

This theorem is referenced by: (None)