| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > scott0bs | Structured version Visualization version GIF version | ||
| Description: Theorem scheme version of scott0b 9950. The collection of all 𝑥 of minimum rank such that 𝜑(𝑥) is true, is not empty iff there is an 𝑥 such that 𝜑(𝑥) holds. (Contributed by NM, 13-Oct-2003.) Use the Scott operation. (Revised by BTernaryTau, 22-Jul-2026.) |
| Ref | Expression |
|---|---|
| scott0bs | ⊢ (∃𝑥𝜑 ↔ Scott {𝑥 ∣ 𝜑} ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abn0 4337 | . 2 ⊢ ({𝑥 ∣ 𝜑} ≠ ∅ ↔ ∃𝑥𝜑) | |
| 2 | scott0b 9950 | . . 3 ⊢ ({𝑥 ∣ 𝜑} = ∅ ↔ Scott {𝑥 ∣ 𝜑} = ∅) | |
| 3 | 2 | necon3bii 3011 | . 2 ⊢ ({𝑥 ∣ 𝜑} ≠ ∅ ↔ Scott {𝑥 ∣ 𝜑} ≠ ∅) |
| 4 | 1, 3 | bitr3i 280 | 1 ⊢ (∃𝑥𝜑 ↔ Scott {𝑥 ∣ 𝜑} ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∃wex 1811 {cab 2741 ≠ wne 2959 ∅c0 4281 Scott cscott 9941 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6311 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-ov 7433 df-om 7888 df-2nd 8012 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-rdg 8432 df-r1 9781 df-rank 9782 df-scott 9942 |
| This theorem is used by: hta 9975 |
| Copyright terms: Public domain | W3C validator |