| 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 5574 | . 2 ⊢ (( E Fr 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} = ∅) |
| 3 | dfin5 3905 | . . . . 5 ⊢ (𝐵 ∩ 𝑥) = {𝑦 ∈ 𝐵 ∣ 𝑦 ∈ 𝑥} | |
| 4 | epel 5514 | . . . . . 6 ⊢ (𝑦 E 𝑥 ↔ 𝑦 ∈ 𝑥) | |
| 5 | 4 | rabbii 3400 | . . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} = {𝑦 ∈ 𝐵 ∣ 𝑦 ∈ 𝑥} |
| 6 | 3, 5 | eqtr4i 2757 | . . . 4 ⊢ (𝐵 ∩ 𝑥) = {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} |
| 7 | 6 | eqeq1i 2736 | . . 3 ⊢ ((𝐵 ∩ 𝑥) = ∅ ↔ {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} = ∅) |
| 8 | 7 | rexbii 3079 | . 2 ⊢ (∃𝑥 ∈ 𝐵 (𝐵 ∩ 𝑥) = ∅ ↔ ∃𝑥 ∈ 𝐵 {𝑦 ∈ 𝐵 ∣ 𝑦 E 𝑥} = ∅) |
| 9 | 2, 8 | sylibr 234 | 1 ⊢ (( E Fr 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ∃𝑥 ∈ 𝐵 (𝐵 ∩ 𝑥) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 ∃wrex 3056 {crab 3395 Vcvv 3436 ∩ cin 3896 ⊆ wss 3897 ∅c0 4278 class class class wbr 5086 E cep 5510 Fr wfr 5561 |
| 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 5229 ax-nul 5239 ax-pr 5365 |
| 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-in 3904 df-ss 3914 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-br 5087 df-opab 5149 df-eprel 5511 df-fr 5564 |
| This theorem is referenced by: wefrc 5605 onfr 6340 epfrs 9616 |
| Copyright terms: Public domain | W3C validator |