MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  frirr Structured version   Visualization version   GIF version

Theorem frirr 5627
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.
StepHypRef Expression
1 simpl 488 . . 3 ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝑅 Fr 𝐴)
2 snssi 4746 . . . 4 (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴)
32adantl 487 . . 3 ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴)
4 snnzg 4735 . . . 4 (𝐵 ∈ 𝐴 → {𝐵} ≠ ∅)
54adantl 487 . . 3 ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ≠ ∅)
6 snex 5397 . . . 4 {𝐵} ∈ V
76frc 5614 . . 3 ((𝑅 Fr 𝐴 ∧ {𝐵} ⊆ 𝐴 ∧ {𝐵} ≠ ∅) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅)
81, 3, 5, 7syl3anc 1398 . 2 ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅)
9 breq1 5106 . . . . . . 7 (𝑥 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑧𝑅𝑦))
109rabeq0w 4337 . . . . . 6 ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦)
11 breq2 5107 . . . . . . . 8 (𝑦 = 𝐵 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝐵))
1211notbid 321 . . . . . . 7 (𝑦 = 𝐵 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐵))
1312ralbidv 3186 . . . . . 6 (𝑦 = 𝐵 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
1410, 13bitrid 286 . . . . 5 (𝑦 = 𝐵 → ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
1514rexsng 4637 . . . 4 (𝐵 ∈ 𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
16 breq1 5106 . . . . . 6 (𝑧 = 𝐵 → (𝑧𝑅𝐵 ↔ 𝐵𝑅𝐵))
1716notbid 321 . . . . 5 (𝑧 = 𝐵 → (¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵))
1817ralsng 4636 . . . 4 (𝐵 ∈ 𝐴 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵))
1915, 18bitrd 282 . . 3 (𝐵 ∈ 𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ¬ 𝐵𝑅𝐵))
2019adantl 487 . 2 ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ¬ 𝐵𝑅𝐵))
218, 20mpbid 235 1 ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ∃wrex 3087  {crab 3413   ⊆ wss 3899  ∅c0 4279  {csn 4584   class class class wbr 5103   Fr wfr 5601
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-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 5604
This theorem is used by:  efrirr  5631  predfrirr  6337  dfwe2  7788  bnj1417  35671  efrunt  36478  ifr0  45432
  Copyright terms: Public domain W3C validator