Theorem ndmaovrcl 48196

Description: Reverse closure law, in contrast to ndmovrcl 7595 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 48177	. 2 ⊢ ( ((𝐴𝐹𝐵)) ∈ 𝑆 → ⟨𝐴, 𝐵⟩ ∈ dom 𝐹)
2		opelxp 5683	. . . 4 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) ↔ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
3	2	biimpi 219	. . 3 ⊢ (⟨𝐴, 𝐵⟩ ∈ (𝑆 × 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
4		ndmaov.1	. . 3 ⊢ dom 𝐹 = (𝑆 × 𝑆)
5	3, 4	eleq2s 2878	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ dom 𝐹 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
6	1, 5	syl 18	1 ⊢ ( ((𝐴𝐹𝐵)) ∈ 𝑆 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⟨cop 4589   × cxp 5645  dom cdm 5647   ((caov 48110

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

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-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-res 5659  df-iota 6483  df-fun 6529  df-fv 6535  df-aiota 48077  df-dfat 48111  df-afv 48112  df-aov 48113

This theorem is used by: (None)