Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ndmovcl | Structured version Visualization version GIF version |
Description: The closure of an operation outside its domain, when the domain includes the empty set. This technical lemma can make the operation more convenient to work in some cases. It is dependent on our particular definitions of operation value, function value, and ordered pair. (Contributed by NM, 24-Sep-2004.) |
Ref | Expression |
---|---|
ndmov.1 | ⊢ dom 𝐹 = (𝑆 × 𝑆) |
ndmovcl.2 | ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆) |
ndmovcl.3 | ⊢ ∅ ∈ 𝑆 |
Ref | Expression |
---|---|
ndmovcl | ⊢ (𝐴𝐹𝐵) ∈ 𝑆 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ndmovcl.2 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆) | |
2 | ndmov.1 | . . . 4 ⊢ dom 𝐹 = (𝑆 × 𝑆) | |
3 | 2 | ndmov 6818 | . . 3 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) = ∅) |
4 | ndmovcl.3 | . . 3 ⊢ ∅ ∈ 𝑆 | |
5 | 3, 4 | syl6eqel 2709 | . 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆) |
6 | 1, 5 | pm2.61i 176 | 1 ⊢ (𝐴𝐹𝐵) ∈ 𝑆 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∅c0 3915 × cxp 5112 dom cdm 5114 (class class class)co 6650 |
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-pow 4843 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-eu 2474 df-mo 2475 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-uni 4437 df-br 4654 df-opab 4713 df-xp 5120 df-dm 5124 df-iota 5851 df-fv 5896 df-ov 6653 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |