| 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 7742. (Revised by BTernaryTau, 29-Nov-2024.) |
| Ref | Expression |
|---|---|
| brdomi | ⊢ (𝐴 ≼ 𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reldom 8955 | . . . 4 ⊢ Rel ≼ | |
| 2 | 1 | brrelex12i 5718 | . . 3 ⊢ (𝐴 ≼ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 3 | brdom2g 8960 | . . 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 2146 Vcvv 3457 class class class wbr 5111 –1-1→wf1 6537 ≼ cdom 8947 |
| 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 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| 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 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-br 5112 df-opab 5176 df-xp 5669 df-rel 5670 df-fn 6543 df-f 6544 df-f1 6545 df-dom 8951 |
| This theorem is used by: domssl 9001 domssr 9002 2dom 9034 undom 9060 xpdom2 9067 domunsncan 9072 dom0 9100 fodomr 9123 domssex 9133 domtrfil 9183 sucdom2 9194 sdom1 9217 1sdom2dom 9221 infn0 9269 fodomfir 9294 hartogslem1 9511 infdifsn 9633 acndom 10051 acndom2 10054 fictb 10243 fin23lem41 10351 iundom2g 10541 pwfseq 10666 omssubadd 34757 |
| Copyright terms: Public domain | W3C validator |