Theorem frirr 5631

Description: A well-founded relation is irreflexive. Special case of Proposition 6.23 of [TakeutiZaring] p. 30. (Contributed by NM, 2-Jan-1994.) (Revised by Mario Carneiro, 22-Jun-2015.)

Assertion

Ref	Expression
frirr	⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵)

Proof of Theorem frirr

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 488	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝑅 Fr 𝐴)
2		snssi 4746	. . . 4 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴)
3	2	adantl 487	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴)
4		snnzg 4735	. . . 4 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ≠ ∅)
5	4	adantl 487	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ≠ ∅)
6		snex 5404	. . . 4 ⊢ {𝐵} ∈ V
7	6	frc 5618	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ {𝐵} ⊆ 𝐴 ∧ {𝐵} ≠ ∅) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅)
8	1, 3, 5, 7	syl3anc 1398	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅)
9		breq1 5106	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑧𝑅𝑦))
10	9	rabeq0w 4337	. . . . . 6 ⊢ ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦)
11		breq2 5107	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝐵))
12	11	notbid 321	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐵))
13	12	ralbidv 3185	. . . . . 6 ⊢ (𝑦 = 𝐵 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
14	10, 13	bitrid 286	. . . . 5 ⊢ (𝑦 = 𝐵 → ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
15	14	rexsng 4637	. . . 4 ⊢ (𝐵 ∈ 𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
16		breq1 5106	. . . . . 6 ⊢ (𝑧 = 𝐵 → (𝑧𝑅𝐵 ↔ 𝐵𝑅𝐵))
17	16	notbid 321	. . . . 5 ⊢ (𝑧 = 𝐵 → (¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵))
18	17	ralsng 4636	. . . 4 ⊢ (𝐵 ∈ 𝐴 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵))
19	15, 18	bitrd 282	. . 3 ⊢ (𝐵 ∈ 𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ¬ 𝐵𝑅𝐵))
20	19	adantl 487	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ¬ 𝐵𝑅𝐵))
21	8, 20	mpbid 235	1 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  {crab 3412   ⊆ wss 3899  ∅c0 4279  {csn 4584   class class class wbr 5103   Fr wfr 5605

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 5251  ax-pr 5398

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 3902  df-un 3904  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-fr 5608

This theorem is used by:  efrirr  5635  predfrirr  6332  dfwe2  7774  bnj1417  35551  efrunt  36293  ifr0  45274