| 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 4757 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴) | |
| 3 | 2 | adantl 481 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴) |
| 4 | snnzg 4724 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ≠ ∅) | |
| 5 | 4 | adantl 481 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ≠ ∅) |
| 6 | snex 5372 | . . . 4 ⊢ {𝐵} ∈ V | |
| 7 | 6 | frc 5577 | . . 3 ⊢ ((𝑅 Fr 𝐴 ∧ {𝐵} ⊆ 𝐴 ∧ {𝐵} ≠ ∅) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅) |
| 8 | 1, 3, 5, 7 | syl3anc 1373 | . 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅) |
| 9 | breq1 5092 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑧𝑅𝑦)) | |
| 10 | 9 | rabeq0w 4334 | . . . . . 6 ⊢ ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦) |
| 11 | breq2 5093 | . . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝐵)) | |
| 12 | 11 | notbid 318 | . . . . . . 7 ⊢ (𝑦 = 𝐵 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝐵)) |
| 13 | 12 | ralbidv 3155 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝑦 ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵)) |
| 14 | 10, 13 | bitrid 283 | . . . . 5 ⊢ (𝑦 = 𝐵 → ({𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵)) |
| 15 | 14 | rexsng 4626 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → (∃𝑦 ∈ {𝐵} {𝑥 ∈ {𝐵} ∣ 𝑥𝑅𝑦} = ∅ ↔ ∀𝑧 ∈ {𝐵} ¬ 𝑧𝑅𝐵)) |
| 16 | breq1 5092 | . . . . . 6 ⊢ (𝑧 = 𝐵 → (𝑧𝑅𝐵 ↔ 𝐵𝑅𝐵)) | |
| 17 | 16 | notbid 318 | . . . . 5 ⊢ (𝑧 = 𝐵 → (¬ 𝑧𝑅𝐵 ↔ ¬ 𝐵𝑅𝐵)) |
| 18 | 17 | ralsng 4625 | . . . 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 1541 ∈ wcel 2111 ≠ wne 2928 ∀wral 3047 ∃wrex 3056 {crab 3395 ⊆ wss 3897 ∅c0 4280 {csn 4573 class class class wbr 5089 Fr wfr 5564 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-br 5090 df-fr 5567 |
| This theorem is referenced by: efrirr 5594 predfrirr 6281 dfwe2 7707 bnj1417 35053 efrunt 35757 ifr0 44541 |
| Copyright terms: Public domain | W3C validator |