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

Theorem frirr 5639
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 4753 . . . 4 (𝐵𝐴 → {𝐵} ⊆ 𝐴)
32adantl 487 . . 3 ((𝑅 Fr 𝐴𝐵𝐴) → {𝐵} ⊆ 𝐴)
4 snnzg 4742 . . . 4 (𝐵𝐴 → {𝐵} ≠ ∅)
54adantl 487 . . 3 ((𝑅 Fr 𝐴𝐵𝐴) → {𝐵} ≠ ∅)
6 snex 5412 . . . 4 {𝐵} ∈ V
76frc 5626 . . 3 ((𝑅 Fr 𝐴 ∧ {𝐵} ⊆ 𝐴 ∧ {𝐵} ≠ ∅) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅)
81, 3, 5, 7syl3anc 1398 . 2 ((𝑅 Fr 𝐴𝐵𝐴) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅)
9 breq1 5114 . . . . . . 7 (𝑥 = 𝑧 → (𝑥𝑅𝑦𝑧𝑅𝑦))
109rabeq0w 4344 . . . . . 6 ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦)
11 breq2 5115 . . . . . . . 8 (𝑦 = 𝐵 → (𝑧𝑅𝑦𝑧𝑅𝐵))
1211notbid 321 . . . . . . 7 (𝑦 = 𝐵 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐵))
1312ralbidv 3190 . . . . . 6 (𝑦 = 𝐵 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
1410, 13bitrid 286 . . . . 5 (𝑦 = 𝐵 → ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
1514rexsng 4644 . . . 4 (𝐵𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵))
16 breq1 5114 . . . . . 6 (𝑧 = 𝐵 → (𝑧𝑅𝐵𝐵𝑅𝐵))
1716notbid 321 . . . . 5 (𝑧 = 𝐵 → (¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵))
1817ralsng 4643 . . . 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 2146  wne 2960  wral 3081  wrex 3091  {crab 3418  wss 3906  c0 4286  {csn 4591   class class class wbr 5111   Fr wfr 5613
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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406
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 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-fr 5616
This theorem is used by:  efrirr  5643  predfrirr  6339  dfwe2  7779  bnj1417  35494  efrunt  36242  ifr0  45217
  Copyright terms: Public domain W3C validator