Theorem fliftf 5439

Description: The domain and range of the function 𝐹. (Contributed by Mario Carneiro, 23-Dec-2016.)

Hypotheses

Ref	Expression
flift.1	⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
flift.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
flift.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)

Assertion

Ref	Expression
fliftf	⊢ (𝜑 → (Fun 𝐹 ↔ 𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆))

Distinct variable groups:   𝑥,𝑅   𝜑,𝑥   𝑥,𝑋   𝑥,𝑆

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem fliftf

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

Step	Hyp	Ref	Expression
1		simpr 103	. . . . 5 ⊢ ((𝜑 ∧ Fun 𝐹) → Fun 𝐹)
2		flift.1	. . . . . . . . . . 11 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
3		flift.2	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
4		flift.3	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)
5	2, 3, 4	fliftel 5433	. . . . . . . . . 10 ⊢ (𝜑 → (𝑦𝐹𝑧 ↔ ∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵)))
6	5	exbidv 1706	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑧∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵)))
7	6	adantr 261	. . . . . . . 8 ⊢ ((𝜑 ∧ Fun 𝐹) → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑧∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵)))
8		rexcom4 2577	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝑋 ∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ ∃𝑧∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵))
9		elisset 2568	. . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ 𝑆 → ∃𝑧 𝑧 = 𝐵)
10	4, 9	syl 14	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑧 𝑧 = 𝐵)
11	10	biantrud 288	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑦 = 𝐴 ↔ (𝑦 = 𝐴 ∧ ∃𝑧 𝑧 = 𝐵)))
12		19.42v 1786	. . . . . . . . . . . 12 ⊢ (∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ (𝑦 = 𝐴 ∧ ∃𝑧 𝑧 = 𝐵))
13	11, 12	syl6rbbr 188	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ 𝑦 = 𝐴))
14	13	rexbidva 2323	. . . . . . . . . 10 ⊢ (𝜑 → (∃𝑥 ∈ 𝑋 ∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴))
15	14	adantr 261	. . . . . . . . 9 ⊢ ((𝜑 ∧ Fun 𝐹) → (∃𝑥 ∈ 𝑋 ∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴))
16	8, 15	syl5bbr 183	. . . . . . . 8 ⊢ ((𝜑 ∧ Fun 𝐹) → (∃𝑧∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴))
17	7, 16	bitrd 177	. . . . . . 7 ⊢ ((𝜑 ∧ Fun 𝐹) → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴))
18	17	abbidv 2155	. . . . . 6 ⊢ ((𝜑 ∧ Fun 𝐹) → {𝑦 ∣ ∃𝑧 𝑦𝐹𝑧} = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴})
19		df-dm 4355	. . . . . 6 ⊢ dom 𝐹 = {𝑦 ∣ ∃𝑧 𝑦𝐹𝑧}
20		eqid 2040	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 ↦ 𝐴) = (𝑥 ∈ 𝑋 ↦ 𝐴)
21	20	rnmpt 4582	. . . . . 6 ⊢ ran (𝑥 ∈ 𝑋 ↦ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴}
22	18, 19, 21	3eqtr4g 2097	. . . . 5 ⊢ ((𝜑 ∧ Fun 𝐹) → dom 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 𝐴))
23		df-fn 4905	. . . . 5 ⊢ (𝐹 Fn ran (𝑥 ∈ 𝑋 ↦ 𝐴) ↔ (Fun 𝐹 ∧ dom 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 𝐴)))
24	1, 22, 23	sylanbrc 394	. . . 4 ⊢ ((𝜑 ∧ Fun 𝐹) → 𝐹 Fn ran (𝑥 ∈ 𝑋 ↦ 𝐴))
25	2, 3, 4	fliftrel 5432	. . . . . . 7 ⊢ (𝜑 → 𝐹 ⊆ (𝑅 × 𝑆))
26	25	adantr 261	. . . . . 6 ⊢ ((𝜑 ∧ Fun 𝐹) → 𝐹 ⊆ (𝑅 × 𝑆))
27		rnss 4564	. . . . . 6 ⊢ (𝐹 ⊆ (𝑅 × 𝑆) → ran 𝐹 ⊆ ran (𝑅 × 𝑆))
28	26, 27	syl 14	. . . . 5 ⊢ ((𝜑 ∧ Fun 𝐹) → ran 𝐹 ⊆ ran (𝑅 × 𝑆))
29		rnxpss 4754	. . . . 5 ⊢ ran (𝑅 × 𝑆) ⊆ 𝑆
30	28, 29	syl6ss 2957	. . . 4 ⊢ ((𝜑 ∧ Fun 𝐹) → ran 𝐹 ⊆ 𝑆)
31		df-f 4906	. . . 4 ⊢ (𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆 ↔ (𝐹 Fn ran (𝑥 ∈ 𝑋 ↦ 𝐴) ∧ ran 𝐹 ⊆ 𝑆))
32	24, 30, 31	sylanbrc 394	. . 3 ⊢ ((𝜑 ∧ Fun 𝐹) → 𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆)
33	32	ex 108	. 2 ⊢ (𝜑 → (Fun 𝐹 → 𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆))
34		ffun 5048	. 2 ⊢ (𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆 → Fun 𝐹)
35	33, 34	impbid1 130	1 ⊢ (𝜑 → (Fun 𝐹 ↔ 𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆))

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   = wceq 1243  ∃wex 1381   ∈ wcel 1393  {cab 2026  ∃wrex 2307   ⊆ wss 2917  ⟨cop 3378   class class class wbr 3764   ↦ cmpt 3818   × cxp 4343  dom cdm 4345  ran crn 4346  Fun wfun 4896   Fn wfn 4897  ⟶wf 4898

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-fv 4910

This theorem is referenced by:  qliftf  6191