Theorem f1od 5727

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

Hypotheses

Ref	Expression
f1od.1	⊢ F = (x ∈ A ↦ C)
f1od.2	⊢ ((φ ∧ x ∈ A) → C ∈ W)
f1od.3	⊢ ((φ ∧ y ∈ B) → D ∈ X)
f1od.4	⊢ (φ → ((x ∈ A ∧ y = C) ↔ (y ∈ B ∧ x = D)))

Assertion

Ref	Expression
f1od	⊢ (φ → F:A–1-1-onto→B)

Distinct variable groups:   x,y,A   x,B,y   y,C   x,D   φ,x,y

Allowed substitution hints:   C(x)   D(y)   F(x, y)   W(x, y)   X(x, y)

Proof of Theorem f1od

Step	Hyp	Ref	Expression
1		f1od.2	. . . 4 ⊢ ((φ ∧ x ∈ A) → C ∈ W)
2	1	ralrimiva 2698	. . 3 ⊢ (φ → ∀x ∈ A C ∈ W)
3		f1od.1	. . . 4 ⊢ F = (x ∈ A ↦ C)
4	3	fnmpt 5690	. . 3 ⊢ (∀x ∈ A C ∈ W → F Fn A)
5	2, 4	syl 15	. 2 ⊢ (φ → F Fn A)
6		f1od.3	. . . . 5 ⊢ ((φ ∧ y ∈ B) → D ∈ X)
7	6	ralrimiva 2698	. . . 4 ⊢ (φ → ∀y ∈ B D ∈ X)
8		eqid 2353	. . . . 5 ⊢ (y ∈ B ↦ D) = (y ∈ B ↦ D)
9	8	fnmpt 5690	. . . 4 ⊢ (∀y ∈ B D ∈ X → (y ∈ B ↦ D) Fn B)
10	7, 9	syl 15	. . 3 ⊢ (φ → (y ∈ B ↦ D) Fn B)
11		f1od.4	. . . . . 6 ⊢ (φ → ((x ∈ A ∧ y = C) ↔ (y ∈ B ∧ x = D)))
12	11	opabbidv 4626	. . . . 5 ⊢ (φ → {⟨y, x⟩ ∣ (x ∈ A ∧ y = C)} = {⟨y, x⟩ ∣ (y ∈ B ∧ x = D)})
13		df-mpt 5653	. . . . . . . 8 ⊢ (x ∈ A ↦ C) = {⟨x, y⟩ ∣ (x ∈ A ∧ y = C)}
14	3, 13	eqtri 2373	. . . . . . 7 ⊢ F = {⟨x, y⟩ ∣ (x ∈ A ∧ y = C)}
15	14	cnveqi 4888	. . . . . 6 ⊢ ◡F = ◡{⟨x, y⟩ ∣ (x ∈ A ∧ y = C)}
16		cnvopab 5031	. . . . . 6 ⊢ ◡{⟨x, y⟩ ∣ (x ∈ A ∧ y = C)} = {⟨y, x⟩ ∣ (x ∈ A ∧ y = C)}
17	15, 16	eqtri 2373	. . . . 5 ⊢ ◡F = {⟨y, x⟩ ∣ (x ∈ A ∧ y = C)}
18		df-mpt 5653	. . . . 5 ⊢ (y ∈ B ↦ D) = {⟨y, x⟩ ∣ (y ∈ B ∧ x = D)}
19	12, 17, 18	3eqtr4g 2410	. . . 4 ⊢ (φ → ◡F = (y ∈ B ↦ D))
20	19	fneq1d 5176	. . 3 ⊢ (φ → (◡F Fn B ↔ (y ∈ B ↦ D) Fn B))
21	10, 20	mpbird 223	. 2 ⊢ (φ → ◡F Fn B)
22		dff1o4 5295	. 2 ⊢ (F:A–1-1-onto→B ↔ (F Fn A ∧ ◡F Fn B))
23	5, 21, 22	sylanbrc 645	1 ⊢ (φ → F:A–1-1-onto→B)

This proof depends on syntax axioms:   → wi 4   ↔ wb 176   ∧ wa 358   = wceq 1642   ∈ wcel 1710  ∀wral 2615  {copab 4623  ^◡ccnv 4772   Fn wfn 4777  –1-1-onto→wf1o 4781   ↦ cmpt 5652

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-reu 2622  df-rmo 2623  df-rab 2624  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-pss 3262  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-0c 4378  df-addc 4379  df-nnc 4380  df-fin 4381  df-lefin 4441  df-ltfin 4442  df-ncfin 4443  df-tfin 4444  df-evenfin 4445  df-oddfin 4446  df-sfin 4447  df-spfin 4448  df-phi 4566  df-op 4567  df-proj1 4568  df-proj2 4569  df-opab 4624  df-br 4641  df-co 4727  df-ima 4728  df-id 4768  df-cnv 4786  df-rn 4787  df-dm 4788  df-fun 4790  df-fn 4791  df-f 4792  df-f1 4793  df-fo 4794  df-f1o 4795  df-mpt 5653

This theorem is used by:  f1o2d  5728