| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > epfrc | Structured version Visualization version GIF version | ||
| Description: A subset of a well-founded class has a minimal element. (Contributed by NM, 17-Feb-2004.) (Revised by David Abernethy, 22-Feb-2011.) |
| Ref | Expression |
|---|---|
| epfrc.1 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| epfrc | ⊢ (( E Fr 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 (𝐵 ∩ 𝑥) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | epfrc.1 | . . 3 ⊢ 𝐵 ∈ V | |
| 2 | 1 | frc 5587 | . 2 ⊢ (( E Fr 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} = ∅) |
| 3 | dfin5 3898 | . . . . 5 ⊢ (𝐵 ∩ 𝑥) = {𝑦 ∈ 𝐵 ∣ 𝑦 ∈ 𝑥} | |
| 4 | epel 5527 | . . . . . 6 ⊢ (𝑦 E 𝑥 ↔ 𝑦 ∈ 𝑥) | |
| 5 | 4 | rabbii 3395 | . . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} = {𝑦 ∈ 𝐵 ∣ 𝑦 ∈ 𝑥} |
| 6 | 3, 5 | eqtr4i 2763 | . . . 4 ⊢ (𝐵 ∩ 𝑥) = {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} |
| 7 | 6 | eqeq1i 2742 | . . 3 ⊢ ((𝐵 ∩ 𝑥) = ∅ ↔ {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} = ∅) |
| 8 | 7 | rexbii 3085 | . 2 ⊢ (∃𝑥 ∈ 𝐵 (𝐵 ∩ 𝑥) = ∅ ↔ ∃𝑥 ∈ 𝐵 {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} = ∅) |
| 9 | 2, 8 | sylibr 234 | 1 ⊢ (( E Fr 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 (𝐵 ∩ 𝑥) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∃wrex 3062 {crab 3390 Vcvv 3430 ∩ cin 3889 ⊆ wss 3890 ∅c0 4274 class class class wbr 5086 E cep 5523 Fr wfr 5574 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5231 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-br 5087 df-opab 5149 df-eprel 5524 df-fr 5577 |
| This theorem is referenced by: wefrc 5618 onfr 6356 epfrs 9643 |
| Copyright terms: Public domain | W3C validator |