| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frirr | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| frirr | ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 482 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝑅 Fr 𝐴) | |
| 2 | snssi 4772 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴) | |
| 3 | 2 | adantl 481 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴) |
| 4 | snnzg 4738 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ≠ ∅) | |
| 5 | 4 | adantl 481 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ≠ ∅) |
| 6 | snex 5391 | . . . 4 ⊢ {𝐵} ∈ V | |
| 7 | 6 | frc 5601 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ {𝐵} ⊆ 𝐴 ∧ {𝐵} ≠ ∅) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅) |
| 8 | 1, 3, 5, 7 | syl3anc 1373 | . 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅) |
| 9 | breq1 5110 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑧𝑅𝑦)) | |
| 10 | 9 | rabeq0w 4350 | . . . . . 6 ⊢ ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦) |
| 11 | breq2 5111 | . . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝐵)) | |
| 12 | 11 | notbid 318 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐵)) |
| 13 | 12 | ralbidv 3156 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵)) |
| 14 | 10, 13 | bitrid 283 | . . . . 5 ⊢ (𝑦 = 𝐵 → ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵)) |
| 15 | 14 | rexsng 4640 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵)) |
| 16 | breq1 5110 | . . . . . 6 ⊢ (𝑧 = 𝐵 → (𝑧𝑅𝐵 ↔ 𝐵𝑅𝐵)) | |
| 17 | 16 | notbid 318 | . . . . 5 ⊢ (𝑧 = 𝐵 → (¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵)) |
| 18 | 17 | ralsng 4639 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵)) |
| 19 | 15, 18 | bitrd 279 | . . 3 ⊢ (𝐵 ∈ 𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ¬ 𝐵𝑅𝐵)) |
| 20 | 19 | adantl 481 | . 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ¬ 𝐵𝑅𝐵)) |
| 21 | 8, 20 | mpbid 232 | 1 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ¬ 𝐵𝑅𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ∃wrex 3053 {crab 3405 ⊆ wss 3914 ∅c0 4296 {csn 4589 class class class wbr 5107 Fr wfr 5588 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-br 5108 df-fr 5591 |
| This theorem is referenced by: efrirr 5618 predfrirr 6307 dfwe2 7750 bnj1417 35031 efrunt 35700 ifr0 44439 |
| Copyright terms: Public domain | W3C validator |