Theorem son2lpi 6130

Description: A strict order relation has no 2-cycle loops. (Contributed by NM, 10-Feb-1996.) (Revised by Mario Carneiro, 10-May-2013.)

Hypotheses

Ref	Expression
soi.1	⊢ 𝑅 Or 𝑆
soi.2	⊢ 𝑅 ⊆ (𝑆 × 𝑆)

Assertion

Ref	Expression
son2lpi	⊢ ¬ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴)

Proof of Theorem son2lpi

Step	Hyp	Ref	Expression
1		soi.1	. . 3 ⊢ 𝑅 Or 𝑆
2		soi.2	. . 3 ⊢ 𝑅 ⊆ (𝑆 × 𝑆)
3	1, 2	soirri 6128	. 2 ⊢ ¬ 𝐴𝑅𝐴
4	1, 2	sotri 6129	. 2 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴) → 𝐴𝑅𝐴)
5	3, 4	mto 200	1 ⊢ ¬ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴)

Syntax hints:  ¬ wn 3   ∧ wa 400   ⊆ wss 3906   class class class wbr 5110   Or wor 5570   × cxp 5661

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5258  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-po 5571  df-so 5572  df-xp 5669

This theorem is referenced by: (None)