Theorem son2lpi 6123

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 6121	. 2 ⊢ ¬ 𝐴𝑅𝐴
4	1, 2	sotri 6122	. 2 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴) → 𝐴𝑅𝐴)
5	3, 4	mto 200	1 ⊢ ¬ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐴)

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   ⊆ wss 3896   class class class wbr 5102   Or wor 5557   × cxp 5648

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-po 5558  df-so 5559  df-xp 5656

This theorem is used by: (None)