| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dom1o | GIF version | ||
| Description: Two ways of saying that a set is inhabited. (Contributed by Jim Kingdon, 3-Jan-2026.) |
| Ref | Expression |
|---|---|
| dom1o | ⊢ (𝐴 ∈ 𝑉 → (1o ≼ 𝐴 ↔ ∃𝑗 𝑗 ∈ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdomg 6984 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (1o ≼ 𝐴 ↔ ∃𝑓 𝑓:1o–1-1→𝐴)) | |
| 2 | f1f 5572 | . . . . . 6 ⊢ (𝑓:1o–1-1→𝐴 → 𝑓:1o⟶𝐴) | |
| 3 | 0lt1o 6672 | . . . . . . 7 ⊢ ∅ ∈ 1o | |
| 4 | ffvelcdm 5809 | . . . . . . 7 ⊢ ((𝑓:1o⟶𝐴 ∧ ∅ ∈ 1o) → (𝑓‘∅) ∈ 𝐴) | |
| 5 | 3, 4 | mpan2 425 | . . . . . 6 ⊢ (𝑓:1o⟶𝐴 → (𝑓‘∅) ∈ 𝐴) |
| 6 | elex2 2829 | . . . . . 6 ⊢ ((𝑓‘∅) ∈ 𝐴 → ∃𝑗 𝑗 ∈ 𝐴) | |
| 7 | 2, 5, 6 | 3syl 17 | . . . . 5 ⊢ (𝑓:1o–1-1→𝐴 → ∃𝑗 𝑗 ∈ 𝐴) |
| 8 | 7 | a1i 9 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑓:1o–1-1→𝐴 → ∃𝑗 𝑗 ∈ 𝐴)) |
| 9 | 8 | exlimdv 1868 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (∃𝑓 𝑓:1o–1-1→𝐴 → ∃𝑗 𝑗 ∈ 𝐴)) |
| 10 | 1, 9 | sylbid 150 | . 2 ⊢ (𝐴 ∈ 𝑉 → (1o ≼ 𝐴 → ∃𝑗 𝑗 ∈ 𝐴)) |
| 11 | 0ex 4236 | . . . . . . . 8 ⊢ ∅ ∈ V | |
| 12 | vex 2815 | . . . . . . . 8 ⊢ 𝑗 ∈ V | |
| 13 | 11, 12 | opex 4344 | . . . . . . 7 ⊢ 〈∅, 𝑗〉 ∈ V |
| 14 | 13 | snex 4297 | . . . . . 6 ⊢ {〈∅, 𝑗〉} ∈ V |
| 15 | 14 | a1i 9 | . . . . 5 ⊢ (𝑗 ∈ 𝐴 → {〈∅, 𝑗〉} ∈ V) |
| 16 | f1sng 5657 | . . . . . . 7 ⊢ ((∅ ∈ 1o ∧ 𝑗 ∈ 𝐴) → {〈∅, 𝑗〉}:{∅}–1-1→𝐴) | |
| 17 | 3, 16 | mpan 424 | . . . . . 6 ⊢ (𝑗 ∈ 𝐴 → {〈∅, 𝑗〉}:{∅}–1-1→𝐴) |
| 18 | df1o2 6660 | . . . . . . 7 ⊢ 1o = {∅} | |
| 19 | f1eq2 5568 | . . . . . . 7 ⊢ (1o = {∅} → ({〈∅, 𝑗〉}:1o–1-1→𝐴 ↔ {〈∅, 𝑗〉}:{∅}–1-1→𝐴)) | |
| 20 | 18, 19 | ax-mp 5 | . . . . . 6 ⊢ ({〈∅, 𝑗〉}:1o–1-1→𝐴 ↔ {〈∅, 𝑗〉}:{∅}–1-1→𝐴) |
| 21 | 17, 20 | sylibr 134 | . . . . 5 ⊢ (𝑗 ∈ 𝐴 → {〈∅, 𝑗〉}:1o–1-1→𝐴) |
| 22 | f1eq1 5567 | . . . . 5 ⊢ (𝑓 = {〈∅, 𝑗〉} → (𝑓:1o–1-1→𝐴 ↔ {〈∅, 𝑗〉}:1o–1-1→𝐴)) | |
| 23 | 15, 21, 22 | elabd 2961 | . . . 4 ⊢ (𝑗 ∈ 𝐴 → ∃𝑓 𝑓:1o–1-1→𝐴) |
| 24 | 23 | exlimiv 1647 | . . 3 ⊢ (∃𝑗 𝑗 ∈ 𝐴 → ∃𝑓 𝑓:1o–1-1→𝐴) |
| 25 | 24, 1 | imbitrrid 156 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∃𝑗 𝑗 ∈ 𝐴 → 1o ≼ 𝐴)) |
| 26 | 10, 25 | impbid 129 | 1 ⊢ (𝐴 ∈ 𝑉 → (1o ≼ 𝐴 ↔ ∃𝑗 𝑗 ∈ 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∃wex 1541 ∈ wcel 2203 Vcvv 2812 ∅c0 3507 {csn 3688 〈cop 3691 class class class wbr 4108 ⟶wf 5347 –1-1→wf1 5348 ‘cfv 5351 1oc1o 6639 ≼ cdom 6973 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-v 2814 df-sbc 3042 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-br 4109 df-opab 4171 df-id 4413 df-suc 4491 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-1o 6646 df-dom 6976 |
| This theorem is referenced by: dom1oi 7069 |
| Copyright terms: Public domain | W3C validator |