| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 1dom1el | GIF version | ||
| Description: If a set is dominated by one, then any two of its elements are equal. (Contributed by Jim Kingdon, 23-Apr-2025.) |
| Ref | Expression |
|---|---|
| 1dom1el | ⊢ ((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → 𝐵 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdomi 7023 | . . 3 ⊢ (𝐴 ≼ 1o → ∃𝑓 𝑓:𝐴–1-1→1o) | |
| 2 | 1 | 3ad2ant1 1049 | . 2 ⊢ ((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → ∃𝑓 𝑓:𝐴–1-1→1o) |
| 3 | f1f 5593 | . . . . . . 7 ⊢ (𝑓:𝐴–1-1→1o → 𝑓:𝐴⟶1o) | |
| 4 | 3 | adantl 277 | . . . . . 6 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → 𝑓:𝐴⟶1o) |
| 5 | simpl2 1032 | . . . . . 6 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → 𝐵 ∈ 𝐴) | |
| 6 | 4, 5 | ffvelcdmd 5835 | . . . . 5 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → (𝑓‘𝐵) ∈ 1o) |
| 7 | el1o 6700 | . . . . 5 ⊢ ((𝑓‘𝐵) ∈ 1o ↔ (𝑓‘𝐵) = ∅) | |
| 8 | 6, 7 | sylib 122 | . . . 4 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → (𝑓‘𝐵) = ∅) |
| 9 | simpl3 1033 | . . . . . 6 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → 𝐶 ∈ 𝐴) | |
| 10 | 4, 9 | ffvelcdmd 5835 | . . . . 5 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → (𝑓‘𝐶) ∈ 1o) |
| 11 | el1o 6700 | . . . . 5 ⊢ ((𝑓‘𝐶) ∈ 1o ↔ (𝑓‘𝐶) = ∅) | |
| 12 | 10, 11 | sylib 122 | . . . 4 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → (𝑓‘𝐶) = ∅) |
| 13 | 8, 12 | eqtr4d 2274 | . . 3 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → (𝑓‘𝐵) = (𝑓‘𝐶)) |
| 14 | simpr 110 | . . . 4 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → 𝑓:𝐴–1-1→1o) | |
| 15 | f1veqaeq 5965 | . . . 4 ⊢ ((𝑓:𝐴–1-1→1o ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴)) → ((𝑓‘𝐵) = (𝑓‘𝐶) → 𝐵 = 𝐶)) | |
| 16 | 14, 5, 9, 15 | syl12anc 1276 | . . 3 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → ((𝑓‘𝐵) = (𝑓‘𝐶) → 𝐵 = 𝐶)) |
| 17 | 13, 16 | mpd 13 | . 2 ⊢ (((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ 𝑓:𝐴–1-1→1o) → 𝐵 = 𝐶) |
| 18 | 2, 17 | exlimddv 1954 | 1 ⊢ ((𝐴 ≼ 1o ∧ 𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) → 𝐵 = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∃wex 1545 ∈ wcel 2209 ∅c0 3520 class class class wbr 4125 ⟶wf 5368 –1-1→wf1 5369 ‘cfv 5372 1oc1o 6670 ≼ cdom 7011 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-id 4433 df-suc 4511 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fv 5380 df-1o 6677 df-dom 7014 |
| This theorem is referenced by: modom 7098 |
| Copyright terms: Public domain | W3C validator |