Theorem efrunt 36399

Description: If 𝐴 is well-founded by E, then it is untangled. (Contributed by Scott Fenton, 1-Mar-2011.)

Assertion

Ref	Expression
efrunt	⊢ ( E Fr 𝐴 → ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥)

Distinct variable group:   𝑥,𝐴

Proof of Theorem efrunt

Step	Hyp	Ref	Expression
1		frirr 5623	. . 3 ⊢ (( E Fr 𝐴 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥 E 𝑥)
2		epel 5550	. . 3 ⊢ (𝑥 E 𝑥 ↔ 𝑥 ∈ 𝑥)
3	1, 2	sylnib 331	. 2 ⊢ (( E Fr 𝐴 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥 ∈ 𝑥)
4	3	ralrimiva 3154	1 ⊢ ( E Fr 𝐴 → ∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∈ wcel 2145  ∀wral 3076   class class class wbr 5102   E cep 5546   Fr wfr 5597

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 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 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-eprel 5547  df-fr 5600

This theorem is used by: (None)