Theorem fprb 7150

Description: A condition for functionhood over a pair. (Contributed by Scott Fenton, 16-Sep-2013.)

Hypotheses

Ref	Expression
fprb.1	⊢ 𝐴 ∈ V
fprb.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
fprb	⊢ (𝐴 ≠ 𝐵 → (𝐹:{𝐴, 𝐵}⟶𝑅 ↔ ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦   𝑥,𝑅,𝑦

Proof of Theorem fprb

Step	Hyp	Ref	Expression
1		fprb.1	. . . . . . 7 ⊢ 𝐴 ∈ V
2	1	prid1 4721	. . . . . 6 ⊢ 𝐴 ∈ {𝐴, 𝐵}
3		ffvelcdm 7035	. . . . . 6 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ∈ {𝐴, 𝐵}) → (𝐹‘𝐴) ∈ 𝑅)
4	2, 3	mpan2 692	. . . . 5 ⊢ (𝐹:{𝐴, 𝐵}⟶𝑅 → (𝐹‘𝐴) ∈ 𝑅)
5	4	adantr 480	. . . 4 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → (𝐹‘𝐴) ∈ 𝑅)
6		fprb.2	. . . . . . 7 ⊢ 𝐵 ∈ V
7	6	prid2 4722	. . . . . 6 ⊢ 𝐵 ∈ {𝐴, 𝐵}
8		ffvelcdm 7035	. . . . . 6 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐵 ∈ {𝐴, 𝐵}) → (𝐹‘𝐵) ∈ 𝑅)
9	7, 8	mpan2 692	. . . . 5 ⊢ (𝐹:{𝐴, 𝐵}⟶𝑅 → (𝐹‘𝐵) ∈ 𝑅)
10	9	adantr 480	. . . 4 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → (𝐹‘𝐵) ∈ 𝑅)
11		fvex 6855	. . . . . . . 8 ⊢ (𝐹‘𝐴) ∈ V
12	1, 11	fvpr1 7148	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 → ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) = (𝐹‘𝐴))
13		fvex 6855	. . . . . . . 8 ⊢ (𝐹‘𝐵) ∈ V
14	6, 13	fvpr2 7149	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 → ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) = (𝐹‘𝐵))
15		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴))
16		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴))
17	15, 16	eqeq12d 2753	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ (𝐹‘𝐴) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴)))
18		eqcom 2744	. . . . . . . . 9 ⊢ ((𝐹‘𝐴) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) ↔ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) = (𝐹‘𝐴))
19	17, 18	bitrdi 287	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) = (𝐹‘𝐴)))
20		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵))
21		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵))
22	20, 21	eqeq12d 2753	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → ((𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ (𝐹‘𝐵) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵)))
23		eqcom 2744	. . . . . . . . 9 ⊢ ((𝐹‘𝐵) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) ↔ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) = (𝐹‘𝐵))
24	22, 23	bitrdi 287	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → ((𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) = (𝐹‘𝐵)))
25	1, 6, 19, 24	ralpr 4659	. . . . . . 7 ⊢ (∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ (({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) = (𝐹‘𝐴) ∧ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) = (𝐹‘𝐵)))
26	12, 14, 25	sylanbrc 584	. . . . . 6 ⊢ (𝐴 ≠ 𝐵 → ∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥))
27	26	adantl 481	. . . . 5 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → ∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥))
28		ffn 6670	. . . . . 6 ⊢ (𝐹:{𝐴, 𝐵}⟶𝑅 → 𝐹 Fn {𝐴, 𝐵})
29	1, 6, 11, 13	fpr 7109	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 → {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}:{𝐴, 𝐵}⟶{(𝐹‘𝐴), (𝐹‘𝐵)})
30	29	ffnd 6671	. . . . . 6 ⊢ (𝐴 ≠ 𝐵 → {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩} Fn {𝐴, 𝐵})
31		eqfnfv 6985	. . . . . 6 ⊢ ((𝐹 Fn {𝐴, 𝐵} ∧ {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩} Fn {𝐴, 𝐵}) → (𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩} ↔ ∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥)))
32	28, 30, 31	syl2an 597	. . . . 5 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → (𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩} ↔ ∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥)))
33	27, 32	mpbird 257	. . . 4 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → 𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩})
34		opeq2 4832	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐴) → ⟨𝐴, 𝑥⟩ = ⟨𝐴, (𝐹‘𝐴)⟩)
35	34	preq1d 4698	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝐴) → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, 𝑦⟩})
36	35	eqeq2d 2748	. . . . 5 ⊢ (𝑥 = (𝐹‘𝐴) → (𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} ↔ 𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, 𝑦⟩}))
37		opeq2 4832	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝐵) → ⟨𝐵, 𝑦⟩ = ⟨𝐵, (𝐹‘𝐵)⟩)
38	37	preq2d 4699	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝐵) → {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, 𝑦⟩} = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩})
39	38	eqeq2d 2748	. . . . 5 ⊢ (𝑦 = (𝐹‘𝐵) → (𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, 𝑦⟩} ↔ 𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}))
40	36, 39	rspc2ev 3591	. . . 4 ⊢ (((𝐹‘𝐴) ∈ 𝑅 ∧ (𝐹‘𝐵) ∈ 𝑅 ∧ 𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}) → ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩})
41	5, 10, 33, 40	syl3anc 1374	. . 3 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩})
42	41	expcom 413	. 2 ⊢ (𝐴 ≠ 𝐵 → (𝐹:{𝐴, 𝐵}⟶𝑅 → ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}))
43		vex 3446	. . . . . . 7 ⊢ 𝑥 ∈ V
44		vex 3446	. . . . . . 7 ⊢ 𝑦 ∈ V
45	1, 6, 43, 44	fpr 7109	. . . . . 6 ⊢ (𝐴 ≠ 𝐵 → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶{𝑥, 𝑦})
46		prssi 4779	. . . . . 6 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑅) → {𝑥, 𝑦} ⊆ 𝑅)
47		fss 6686	. . . . . 6 ⊢ (({⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶{𝑥, 𝑦} ∧ {𝑥, 𝑦} ⊆ 𝑅) → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅)
48	45, 46, 47	syl2an 597	. . . . 5 ⊢ ((𝐴 ≠ 𝐵 ∧ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑅)) → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅)
49	48	ex 412	. . . 4 ⊢ (𝐴 ≠ 𝐵 → ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑅) → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅))
50		feq1 6648	. . . . 5 ⊢ (𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} → (𝐹:{𝐴, 𝐵}⟶𝑅 ↔ {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅))
51	50	biimprcd 250	. . . 4 ⊢ ({⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅 → (𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} → 𝐹:{𝐴, 𝐵}⟶𝑅))
52	49, 51	syl6 35	. . 3 ⊢ (𝐴 ≠ 𝐵 → ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑅) → (𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} → 𝐹:{𝐴, 𝐵}⟶𝑅)))
53	52	rexlimdvv 3194	. 2 ⊢ (𝐴 ≠ 𝐵 → (∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} → 𝐹:{𝐴, 𝐵}⟶𝑅))
54	42, 53	impbid 212	1 ⊢ (𝐴 ≠ 𝐵 → (𝐹:{𝐴, 𝐵}⟶𝑅 ↔ ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  Vcvv 3442   ⊆ wss 3903  {cpr 4584  ⟨cop 4588   Fn wfn 6495  ⟶wf 6496  ‘cfv 6500

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508

This theorem is referenced by:  2arymaptf1  49010  prelrrx2b  49071