| 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 7680. (Revised by BTernaryTau, 29-Nov-2024.) |
| Ref | Expression |
|---|---|
| brdomi | ⊢ (𝐴 ≼ 𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reldom 8891 | . . . 4 ⊢ Rel ≼ | |
| 2 | 1 | brrelex12i 5679 | . . 3 ⊢ (𝐴 ≼ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 3 | brdom2g 8896 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵)) | |
| 4 | 2, 3 | syl 17 | . 2 ⊢ (𝐴 ≼ 𝐵 → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵)) |
| 5 | 4 | ibi 267 | 1 ⊢ (𝐴 ≼ 𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∃wex 1780 ∈ wcel 2113 Vcvv 3440 class class class wbr 5098 –1-1→wf1 6489 ≼ cdom 8883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-xp 5630 df-rel 5631 df-fn 6495 df-f 6496 df-f1 6497 df-dom 8887 |
| This theorem is referenced by: domssl 8937 domssr 8938 2dom 8969 undom 8995 xpdom2 9002 domunsncan 9007 dom0 9035 fodomr 9058 domssex 9068 domtrfil 9118 sucdom2 9129 sdom1 9152 1sdom2dom 9156 infn0 9204 fodomfir 9230 hartogslem1 9449 infdifsn 9568 acndom 9963 acndom2 9966 fictb 10156 fin23lem41 10264 iundom2g 10452 pwfseq 10577 omssubadd 34459 |
| Copyright terms: Public domain | W3C validator |