| 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 7737. (Revised by BTernaryTau, 29-Nov-2024.) |
| Ref | Expression |
|---|---|
| brdomi | ⊢ (𝐴 ≼ 𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reldom 8961 | . . . 4 ⊢ Rel ≼ | |
| 2 | 1 | brrelex12i 5710 | . . 3 ⊢ (𝐴 ≼ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 3 | brdom2g 8966 | . . 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 |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∃wex 1812 ∈ wcel 2145 Vcvv 3450 class class class wbr 5103 –1-1→wf1 6530 ≼ cdom 8953 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5661 df-rel 5662 df-fn 6536 df-f 6537 df-f1 6538 df-dom 8957 |
| This theorem is used by: domssl 9007 domssr 9008 2dom 9040 undom 9066 xpdom2 9073 domunsncan 9078 dom0 9106 fodomr 9129 domssex 9139 domtrfil 9189 sucdom2 9200 sdom1 9223 1sdom2dom 9227 infn0 9275 fodomfir 9300 hartogslem1 9517 infdifsn 9639 acndom 10057 acndom2 10060 fictb 10249 fin23lem41 10357 iundom2g 10551 pwfseq 10676 omssubadd 34814 |
| Copyright terms: Public domain | W3C validator |