Theorem predfrirr 6330

Description: Given a well-founded relation, a class is not a member of its predecessor class. (Contributed by Scott Fenton, 22-Apr-2011.)

Assertion

Ref	Expression
predfrirr	⊢ (𝑅 Fr 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))

Proof of Theorem predfrirr

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

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145   class class class wbr 5103   Fr wfr 5601  Predcpred 6296

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-fr 5604  df-xp 5657  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297

This theorem is used by:  frrlem12  8299