Theorem brdom2g 8998

Description: Dominance relation. This variation of brdomg 8999 does not require the Axiom of Union. (Contributed by NM, 15-Jun-1998.) Extract from a subproof of brdomg 8999. (Revised by BTernaryTau, 29-Nov-2024.)

Assertion

Ref	Expression
brdom2g	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵))

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

Allowed substitution hints:   𝑉(𝑓)   𝑊(𝑓)

Proof of Theorem brdom2g

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1eq2 6785	. . 3 ⊢ (𝑥 = 𝐴 → (𝑓:𝑥–1-1→𝑦 ↔ 𝑓:𝐴–1-1→𝑦))
2	1	exbidv 1955	. 2 ⊢ (𝑥 = 𝐴 → (∃𝑓 𝑓:𝑥–1-1→𝑦 ↔ ∃𝑓 𝑓:𝐴–1-1→𝑦))
3		f1eq3 6786	. . 3 ⊢ (𝑦 = 𝐵 → (𝑓:𝐴–1-1→𝑦 ↔ 𝑓:𝐴–1-1→𝐵))
4	3	exbidv 1955	. 2 ⊢ (𝑦 = 𝐵 → (∃𝑓 𝑓:𝐴–1-1→𝑦 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵))
5		df-dom 8989	. 2 ⊢ ≼ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑓 𝑓:𝑥–1-1→𝑦}
6	2, 4, 5	brabg 5518	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ≼ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1→𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2146   class class class wbr 5106  –1-1→wf1 6544   ≼ cdom 8985

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-fn 6550  df-f 6551  df-f1 6552  df-dom 8989

This theorem is used by:  brdomg  8999  brdomi  9000  f1dom4g  9006  0domg  9137