Theorem f1dom4g 8937

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 8943 does not require the Axiom of Replacement nor the Axiom of Power Sets nor the Axiom of Union. (Contributed by BTernaryTau, 7-Dec-2024.)

Assertion

Ref	Expression
f1dom4g	⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊 ∧ 𝐵 ∈ 𝑋) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐴 ≼ 𝐵)

Proof of Theorem f1dom4g

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1eq1 6751	. . . . 5 ⊢ (𝑓 = 𝐹 → (𝑓:𝐴–1-1→𝐵 ↔ 𝐹:𝐴–1-1→𝐵))
2	1	spcegv 3563	. . . 4 ⊢ (𝐹 ∈ 𝑉 → (𝐹:𝐴–1-1→𝐵 → ∃𝑓 𝑓:𝐴–1-1→𝐵))
3	2	imp 406	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → ∃𝑓 𝑓:𝐴–1-1→𝐵)
4	3	3ad2antl1 1186	. 2 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊 ∧ 𝐵 ∈ 𝑋) ∧ 𝐹:𝐴–1-1→𝐵) → ∃𝑓 𝑓:𝐴–1-1→𝐵)
5		brdom2g 8929	. . . 4 ⊢ ((𝐴 ∈ 𝑊 ∧ 𝐵 ∈ 𝑋) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵))
6	5	3adant1 1130	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊 ∧ 𝐵 ∈ 𝑋) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵))
7	6	adantr 480	. 2 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊 ∧ 𝐵 ∈ 𝑋) ∧ 𝐹:𝐴–1-1→𝐵) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵))
8	4, 7	mpbird 257	1 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ 𝑊 ∧ 𝐵 ∈ 𝑋) ∧ 𝐹:𝐴–1-1→𝐵) → 𝐴 ≼ 𝐵)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∃wex 1779   ∈ wcel 2109   class class class wbr 5107  –1-1→wf1 6508   ≼ cdom 8916

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-opab 5170  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-dom 8920

This theorem is referenced by:  domssl  8969  domssr  8970