ndmovord - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ndmovord		Structured version Visualization version GIF version

Theorem ndmovord 7550

Description: Elimination of redundant antecedents in an ordering law. (Contributed by NM, 7-Mar-1996.)

**Hypotheses**
Ref	Expression
ndmov.1	⊢ dom 𝐹 = (𝑆 × 𝑆)
ndmovord.4	⊢ 𝑅 ⊆ (𝑆 × 𝑆)
ndmovord.5	⊢ ¬ ∅ ∈ 𝑆
ndmovord.6	⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))

**Assertion**
Ref	Expression
ndmovord	⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))

**Proof of Theorem ndmovord**
Step	Hyp	Ref	Expression
1		ndmovord.6	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
2	1	3expia 1122	. 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
3		ndmovord.4	. . . . 5 ⊢ 𝑅 ⊆ (𝑆 × 𝑆)
4	3	brel 5690	. . . 4 ⊢ (𝐴𝑅𝐵 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
5	3	brel 5690	. . . . 5 ⊢ ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) → ((𝐶𝐹𝐴) ∈ 𝑆 ∧ (𝐶𝐹𝐵) ∈ 𝑆))
6		ndmov.1	. . . . . . . 8 ⊢ dom 𝐹 = (𝑆 × 𝑆)
7		ndmovord.5	. . . . . . . 8 ⊢ ¬ ∅ ∈ 𝑆
8	6, 7	ndmovrcl 7546	. . . . . . 7 ⊢ ((𝐶𝐹𝐴) ∈ 𝑆 → (𝐶 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆))
9	8	simprd 495	. . . . . 6 ⊢ ((𝐶𝐹𝐴) ∈ 𝑆 → 𝐴 ∈ 𝑆)
10	6, 7	ndmovrcl 7546	. . . . . . 7 ⊢ ((𝐶𝐹𝐵) ∈ 𝑆 → (𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
11	10	simprd 495	. . . . . 6 ⊢ ((𝐶𝐹𝐵) ∈ 𝑆 → 𝐵 ∈ 𝑆)
12	9, 11	anim12i 614	. . . . 5 ⊢ (((𝐶𝐹𝐴) ∈ 𝑆 ∧ (𝐶𝐹𝐵) ∈ 𝑆) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
13	5, 12	syl 17	. . . 4 ⊢ ((𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵) → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
14	4, 13	pm5.21ni 377	. . 3 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))
15	14	a1d 25	. 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵))))
16	2, 15	pm2.61i 182	1 ⊢ (𝐶 ∈ 𝑆 → (𝐴𝑅𝐵 ↔ (𝐶𝐹𝐴)𝑅(𝐶𝐹𝐵)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ⊆ wss 3902 ∅c0 4286 class class class wbr 5099 × cxp 5623 dom cdm 5625 (class class class)co 7360

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4287 df-if 4481 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-xp 5631 df-dm 5635 df-iota 6449 df-fv 6501 df-ov 7363

This theorem is referenced by: ltapi 10818 ltmpi 10819 ltanq 10886 ltmnq 10887 ltapr 10960 ltasr 11015

W3C validator