Theorem f1od 7399

Description: Describe an implicit one-to-one onto function. (Contributed by Mario Carneiro, 12-May-2014.)

Hypotheses

Ref	Expression
f1od.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
f1od.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑊)
f1od.3	⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐷 ∈ 𝑋)
f1od.4	⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷)))

Assertion

Ref	Expression
f1od	⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝑥,𝐷   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐶(𝑥)   𝐷(𝑦)   𝐹(𝑥,𝑦)   𝑊(𝑥,𝑦)   𝑋(𝑥,𝑦)

Proof of Theorem f1od

Step	Hyp	Ref	Expression
1		f1od.1	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
2		f1od.2	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑊)
3		f1od.3	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐷 ∈ 𝑋)
4		f1od.4	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷)))
5	1, 2, 3, 4	f1ocnvd 7398	. 2 ⊢ (𝜑 → (𝐹:𝐴–1-1-onto→𝐵 ∧ ◡𝐹 = (𝑦 ∈ 𝐵 ↦ 𝐷)))
6	5	simpld 497	1 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114   ↦ cmpt 5148  ^◡ccnv 5556  –1-1-onto→wf1o 6356

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364

This theorem is referenced by:  cnvf1o  7808  ixpsnf1o  8504  en2d  8547  pw2f1o  8624  seqf1olem1  13412  fsumrev  15136  resf1o  30468  fpwrelmap  30471  actfunsnf1o  31877