![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > f1dom3g | Structured version Visualization version GIF version |
Description: The domain of a one-to-one set function is dominated by its codomain when the latter is a set. This variation of f1domg 9032 does not require the Axiom of Replacement nor the Axiom of Power Sets. (Contributed by BTernaryTau, 9-Sep-2024.) |
Ref | Expression |
---|---|
f1dom3g | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐹:𝐴–1-1→𝐵) → 𝐴 ≼ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1eq1 6812 | . . . . 5 ⊢ (𝑓 = 𝐹 → (𝑓:𝐴–1-1→𝐵 ↔ 𝐹:𝐴–1-1→𝐵)) | |
2 | 1 | spcegv 3610 | . . . 4 ⊢ (𝐹 ∈ 𝑉 → (𝐹:𝐴–1-1→𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵)) |
3 | 2 | imp 406 | . . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → ∃𝑓 𝑓:𝐴–1-1→𝐵) |
4 | 3 | 3adant2 1131 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐹:𝐴–1-1→𝐵) → ∃𝑓 𝑓:𝐴–1-1→𝐵) |
5 | brdomg 9016 | . . 3 ⊢ (𝐵 ∈ 𝑊 → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵)) | |
6 | 5 | 3ad2ant2 1134 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐹:𝐴–1-1→𝐵) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵)) |
7 | 4, 6 | mpbird 257 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐹:𝐴–1-1→𝐵) → 𝐴 ≼ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1087 ∃wex 1777 ∈ wcel 2108 class class class wbr 5166 –1-1→wf1 6570 ≼ cdom 9001 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-dom 9005 |
This theorem is referenced by: f1dom2g 9029 undom 9125 f1domfi 9247 f1domfi2 9248 sucdom2 9269 |
Copyright terms: Public domain | W3C validator |