Theorem predfrirr 6281

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 5592	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑋 ∈ 𝐴) → ¬ 𝑋𝑅𝑋)
2		elpredg 6262	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
3	2	anidms 566	. . . . . 6 ⊢ (𝑋 ∈ 𝐴 → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
4	3	notbid 318	. . . . 5 ⊢ (𝑋 ∈ 𝐴 → (¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ ¬ 𝑋𝑅𝑋))
5	1, 4	imbitrrid 246	. . . 4 ⊢ (𝑋 ∈ 𝐴 → ((𝑅 Fr 𝐴 ∧ 𝑋 ∈ 𝐴) → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
6	5	expd 415	. . 3 ⊢ (𝑋 ∈ 𝐴 → (𝑅 Fr 𝐴 → (𝑋 ∈ 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))))
7	6	pm2.43b 55	. 2 ⊢ (𝑅 Fr 𝐴 → (𝑋 ∈ 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
8		predel 6268	. . 3 ⊢ (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑋 ∈ 𝐴)
9	8	con3i 154	. 2 ⊢ (¬ 𝑋 ∈ 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
10	7, 9	pm2.61d1 180	1 ⊢ (𝑅 Fr 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2111   class class class wbr 5091   Fr wfr 5566  Predcpred 6247

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-br 5092  df-opab 5154  df-fr 5569  df-xp 5622  df-cnv 5624  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248

This theorem is referenced by:  frrlem12  8227