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

Theorem frirr 5566
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 483 . . 3 ((𝑅 Fr 𝐴𝐵𝐴) → 𝑅 Fr 𝐴)
2 snssi 4741 . . . 4 (𝐵𝐴 → {𝐵} ⊆ 𝐴)
32adantl 482 . . 3 ((𝑅 Fr 𝐴𝐵𝐴) → {𝐵} ⊆ 𝐴)
4 snnzg 4710 . . . 4 (𝐵𝐴 → {𝐵} ≠ ∅)
54adantl 482 . . 3 ((𝑅 Fr 𝐴𝐵𝐴) → {𝐵} ≠ ∅)
6 snex 5354 . . . 4 {𝐵} ∈ V
76frc 5555 . . 3 ((𝑅 Fr 𝐴 ∧ {𝐵} ⊆ 𝐴 ∧ {𝐵} ≠ ∅) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅)
81, 3, 5, 7syl3anc 1370 . 2 ((𝑅 Fr 𝐴𝐵𝐴) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅)
9 breq1 5077 . . . . . . 7 (𝑥 = 𝑧 → (𝑥𝑅𝑦𝑧𝑅𝑦))
109rabeq0w 4317 . . . . . 6 ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦)
11 breq2 5078 . . . . . . . 8 (𝑦 = 𝐵 → (𝑧𝑅𝑦𝑧𝑅𝐵))
1211notbid 318 . . . . . . 7 (𝑦 = 𝐵 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐵))
1312ralbidv 3112 . . . . . 6 (𝑦 = 𝐵 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
1410, 13bitrid 282 . . . . 5 (𝑦 = 𝐵 → ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
1514rexsng 4610 . . . 4 (𝐵𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
16 breq1 5077 . . . . . 6 (𝑧 = 𝐵 → (𝑧𝑅𝐵𝐵𝑅𝐵))
1716notbid 318 . . . . 5 (𝑧 = 𝐵 → (¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵))
1817ralsng 4609 . . . 4 (𝐵𝐴 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵))
1915, 18bitrd 278 . . 3 (𝐵𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ¬ 𝐵𝑅𝐵))
2019adantl 482 . 2 ((𝑅 Fr 𝐴𝐵𝐴) → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ¬ 𝐵𝑅𝐵))
218, 20mpbid 231 1 ((𝑅 Fr 𝐴𝐵𝐴) → ¬ 𝐵𝑅𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wne 2943  wral 3064  wrex 3065  {crab 3068  wss 3887  c0 4256  {csn 4561   class class class wbr 5074   Fr wfr 5541
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-fr 5544
This theorem is referenced by:  efrirr  5570  predfrirr  6237  dfwe2  7624  bnj1417  33021  efrunt  33654  ifr0  42068
  Copyright terms: Public domain W3C validator