| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brdomi | Structured version Visualization version GIF version | ||
| Description: Dominance relation. (Contributed by Mario Carneiro, 26-Apr-2015.) Avoid ax-un 7732. (Revised by BTernaryTau, 29-Nov-2024.) |
| Ref | Expression |
|---|---|
| brdomi | ⊢ (𝐴 ≼ 𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reldom 8945 | . . . 4 ⊢ Rel ≼ | |
| 2 | 1 | brrelex12i 5716 | . . 3 ⊢ (𝐴 ≼ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 3 | brdom2g 8950 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵)) | |
| 4 | 2, 3 | syl 18 | . 2 ⊢ (𝐴 ≼ 𝐵 → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵)) |
| 5 | 4 | ibi 270 | 1 ⊢ (𝐴 ≼ 𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∃wex 1809 ∈ wcel 2143 Vcvv 3455 class class class wbr 5109 –1-1→wf1 6533 ≼ cdom 8937 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-fn 6539 df-f 6540 df-f1 6541 df-dom 8941 |
| This theorem is referenced by: domssl 8991 domssr 8992 2dom 9023 undom 9049 xpdom2 9056 domunsncan 9061 dom0 9089 fodomr 9112 domssex 9122 domtrfil 9172 sucdom2 9183 sdom1 9206 1sdom2dom 9210 infn0 9258 fodomfir 9283 hartogslem1 9500 infdifsn 9622 acndom 10031 acndom2 10034 fictb 10223 fin23lem41 10331 iundom2g 10519 pwfseq 10644 omssubadd 34690 |
| Copyright terms: Public domain | W3C validator |