Theorem fliftf 5999

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 110	. . . . 5 ⊢ ((𝜑 ∧ Fun 𝐹) → Fun 𝐹)
2		flift.1	. . . . . . . . . . 11 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
3		flift.2	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
4		flift.3	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)
5	2, 3, 4	fliftel 5993	. . . . . . . . . 10 ⊢ (𝜑 → (𝑦𝐹𝑧 ↔ ∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵)))
6	5	exbidv 1878	. . . . . . . . 9 ⊢ (𝜑 → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑧∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵)))
7	6	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ Fun 𝐹) → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑧∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵)))
8		rexcom4 2845	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝑋 ∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ ∃𝑧∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵))
9		19.42v 1962	. . . . . . . . . . . 12 ⊢ (∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ (𝑦 = 𝐴 ∧ ∃𝑧 𝑧 = 𝐵))
10		elisset 2836	. . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ 𝑆 → ∃𝑧 𝑧 = 𝐵)
11	4, 10	syl 14	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑧 𝑧 = 𝐵)
12	11	biantrud 304	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑦 = 𝐴 ↔ (𝑦 = 𝐴 ∧ ∃𝑧 𝑧 = 𝐵)))
13	9, 12	bitr4id 199	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ 𝑦 = 𝐴))
14	13	rexbidva 2547	. . . . . . . . . 10 ⊢ (𝜑 → (∃𝑥 ∈ 𝑋 ∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴))
15	14	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ Fun 𝐹) → (∃𝑥 ∈ 𝑋 ∃𝑧(𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴))
16	8, 15	bitr3id 194	. . . . . . . 8 ⊢ ((𝜑 ∧ Fun 𝐹) → (∃𝑧∃𝑥 ∈ 𝑋 (𝑦 = 𝐴 ∧ 𝑧 = 𝐵) ↔ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴))
17	7, 16	bitrd 188	. . . . . . 7 ⊢ ((𝜑 ∧ Fun 𝐹) → (∃𝑧 𝑦𝐹𝑧 ↔ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴))
18	17	abbidv 2358	. . . . . 6 ⊢ ((𝜑 ∧ Fun 𝐹) → {𝑦 ∣ ∃𝑧 𝑦𝐹𝑧} = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴})
19		df-dm 4782	. . . . . 6 ⊢ dom 𝐹 = {𝑦 ∣ ∃𝑧 𝑦𝐹𝑧}
20		eqid 2238	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 ↦ 𝐴) = (𝑥 ∈ 𝑋 ↦ 𝐴)
21	20	rnmpt 5028	. . . . . 6 ⊢ ran (𝑥 ∈ 𝑋 ↦ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝑋 𝑦 = 𝐴}
22	18, 19, 21	3eqtr4g 2296	. . . . 5 ⊢ ((𝜑 ∧ Fun 𝐹) → dom 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 𝐴))
23		df-fn 5378	. . . . 5 ⊢ (𝐹 Fn ran (𝑥 ∈ 𝑋 ↦ 𝐴) ↔ (Fun 𝐹 ∧ dom 𝐹 = ran (𝑥 ∈ 𝑋 ↦ 𝐴)))
24	1, 22, 23	sylanbrc 421	. . . 4 ⊢ ((𝜑 ∧ Fun 𝐹) → 𝐹 Fn ran (𝑥 ∈ 𝑋 ↦ 𝐴))
25	2, 3, 4	fliftrel 5992	. . . . . . 7 ⊢ (𝜑 → 𝐹 ⊆ (𝑅 × 𝑆))
26	25	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ Fun 𝐹) → 𝐹 ⊆ (𝑅 × 𝑆))
27		rnss 5010	. . . . . 6 ⊢ (𝐹 ⊆ (𝑅 × 𝑆) → ran 𝐹 ⊆ ran (𝑅 × 𝑆))
28	26, 27	syl 14	. . . . 5 ⊢ ((𝜑 ∧ Fun 𝐹) → ran 𝐹 ⊆ ran (𝑅 × 𝑆))
29		rnxpss 5217	. . . . 5 ⊢ ran (𝑅 × 𝑆) ⊆ 𝑆
30	28, 29	sstrdi 3260	. . . 4 ⊢ ((𝜑 ∧ Fun 𝐹) → ran 𝐹 ⊆ 𝑆)
31		df-f 5379	. . . 4 ⊢ (𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆 ↔ (𝐹 Fn ran (𝑥 ∈ 𝑋 ↦ 𝐴) ∧ ran 𝐹 ⊆ 𝑆))
32	24, 30, 31	sylanbrc 421	. . 3 ⊢ ((𝜑 ∧ Fun 𝐹) → 𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆)
33	32	ex 115	. 2 ⊢ (𝜑 → (Fun 𝐹 → 𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆))
34		ffun 5534	. 2 ⊢ (𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆 → Fun 𝐹)
35	33, 34	impbid1 142	1 ⊢ (𝜑 → (Fun 𝐹 ↔ 𝐹:ran (𝑥 ∈ 𝑋 ↦ 𝐴)⟶𝑆))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃wex 1545   ∈ wcel 2209  {cab 2224  ∃wrex 2529   ⊆ wss 3220  ⟨cop 3711   class class class wbr 4128   ↦ cmpt 4190   × cxp 4770  dom cdm 4772  ran crn 4773  Fun wfun 5369   Fn wfn 5370  ⟶wf 5371

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-fv 5383

This theorem is referenced by:  qliftf  6888