| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > modom2 | Structured version Visualization version GIF version | ||
| Description: Two ways to express "at most one". (Contributed by Mario Carneiro, 24-Dec-2016.) |
| Ref | Expression |
|---|---|
| modom2 | ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ 𝐴 ≼ 1o) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | modom 9261 | . 2 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ {𝑥 ∣ 𝑥 ∈ 𝐴} ≼ 1o) | |
| 2 | abid2 2871 | . . 3 ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 | |
| 3 | 2 | breq1i 5130 | . 2 ⊢ ({𝑥 ∣ 𝑥 ∈ 𝐴} ≼ 1o ↔ 𝐴 ≼ 1o) |
| 4 | 1, 3 | bitri 275 | 1 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ 𝐴 ≼ 1o) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2107 ∃*wmo 2536 {cab 2712 class class class wbr 5123 1oc1o 8480 ≼ cdom 8964 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pr 5412 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-ne 2932 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3420 df-v 3465 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-br 5124 df-opab 5186 df-id 5558 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-suc 6369 df-iota 6493 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-1o 8487 df-en 8967 df-dom 8968 df-sdom 8969 |
| This theorem is referenced by: f1omoALT 48728 isthinc2 49023 thincciso2 49058 indthincALT 49064 eufunc 49109 |
| Copyright terms: Public domain | W3C validator |