Theorem predpoirr 6336

Description: Given a partial ordering, a class is not a member of its predecessor class. (Contributed by Scott Fenton, 17-Apr-2011.)

Assertion

Ref	Expression
predpoirr	⊢ (𝑅 Po 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))

Proof of Theorem predpoirr

Step	Hyp	Ref	Expression
1		poirr 5570	. . . . 5 ⊢ ((𝑅 Po 𝐴 ∧ 𝑋 ∈ 𝐴) → ¬ 𝑋𝑅𝑋)
2		elpredg 6318	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
3	2	anidms 577	. . . . . 6 ⊢ (𝑋 ∈ 𝐴 → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
4	3	notbid 321	. . . . 5 ⊢ (𝑋 ∈ 𝐴 → (¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ ¬ 𝑋𝑅𝑋))
5	1, 4	imbitrrid 249	. . . 4 ⊢ (𝑋 ∈ 𝐴 → ((𝑅 Po 𝐴 ∧ 𝑋 ∈ 𝐴) → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
6	5	expd 421	. . 3 ⊢ (𝑋 ∈ 𝐴 → (𝑅 Po 𝐴 → (𝑋 ∈ 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))))
7	6	pm2.43b 56	. 2 ⊢ (𝑅 Po 𝐴 → (𝑋 ∈ 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
8		predel 6324	. . 3 ⊢ (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑋 ∈ 𝐴)
9	8	con3i 155	. 2 ⊢ (¬ 𝑋 ∈ 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
10	7, 9	pm2.61d1 182	1 ⊢ (𝑅 Po 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2144   class class class wbr 5102   Po wpo 5556  Predcpred 6303

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 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-po 5558  df-xp 5656  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304

This theorem is used by:  xpord2indlem  8166  xpord3inddlem  8173