Theorem fprb 7200

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 4719	. . . . . 6 ⊢ 𝐴 ∈ {𝐴, 𝐵}
3		ffvelcdm 7082	. . . . . 6 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ∈ {𝐴, 𝐵}) → (𝐹‘𝐴) ∈ 𝑅)
4	2, 3	mpan2 704	. . . . 5 ⊢ (𝐹:{𝐴, 𝐵}⟶𝑅 → (𝐹‘𝐴) ∈ 𝑅)
5	4	adantr 486	. . . 4 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → (𝐹‘𝐴) ∈ 𝑅)
6		fprb.2	. . . . . . 7 ⊢ 𝐵 ∈ V
7	6	prid2 4720	. . . . . 6 ⊢ 𝐵 ∈ {𝐴, 𝐵}
8		ffvelcdm 7082	. . . . . 6 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐵 ∈ {𝐴, 𝐵}) → (𝐹‘𝐵) ∈ 𝑅)
9	7, 8	mpan2 704	. . . . 5 ⊢ (𝐹:{𝐴, 𝐵}⟶𝑅 → (𝐹‘𝐵) ∈ 𝑅)
10	9	adantr 486	. . . 4 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → (𝐹‘𝐵) ∈ 𝑅)
11		fvex 6899	. . . . . . . 8 ⊢ (𝐹‘𝐴) ∈ V
12	1, 11	fvpr1 7198	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 → ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) = (𝐹‘𝐴))
13		fvex 6899	. . . . . . . 8 ⊢ (𝐹‘𝐵) ∈ V
14	6, 13	fvpr2 7199	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 → ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) = (𝐹‘𝐵))
15		fveq2 6886	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴))
16		fveq2 6886	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴))
17	15, 16	eqeq12d 2776	. . . . . . . . 9 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ (𝐹‘𝐴) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴)))
18		eqcom 2767	. . . . . . . . 9 ⊢ ((𝐹‘𝐴) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) ↔ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) = (𝐹‘𝐴))
19	17, 18	bitrdi 290	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) = (𝐹‘𝐴)))
20		fveq2 6886	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝐹‘𝑥) = (𝐹‘𝐵))
21		fveq2 6886	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵))
22	20, 21	eqeq12d 2776	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → ((𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ (𝐹‘𝐵) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵)))
23		eqcom 2767	. . . . . . . . 9 ⊢ ((𝐹‘𝐵) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) ↔ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) = (𝐹‘𝐵))
24	22, 23	bitrdi 290	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → ((𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) = (𝐹‘𝐵)))
25	1, 6, 19, 24	ralpr 4657	. . . . . . 7 ⊢ (∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥) ↔ (({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐴) = (𝐹‘𝐴) ∧ ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝐵) = (𝐹‘𝐵)))
26	12, 14, 25	sylanbrc 595	. . . . . 6 ⊢ (𝐴 ≠ 𝐵 → ∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥))
27	26	adantl 487	. . . . 5 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → ∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥))
28		ffn 6710	. . . . . 6 ⊢ (𝐹:{𝐴, 𝐵}⟶𝑅 → 𝐹 Fn {𝐴, 𝐵})
29	1, 6, 11, 13	fpr 7159	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 → {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}:{𝐴, 𝐵}⟶{(𝐹‘𝐴), (𝐹‘𝐵)})
30	29	ffnd 6711	. . . . . 6 ⊢ (𝐴 ≠ 𝐵 → {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩} Fn {𝐴, 𝐵})
31		eqfnfv 7030	. . . . . 6 ⊢ ((𝐹 Fn {𝐴, 𝐵} ∧ {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩} Fn {𝐴, 𝐵}) → (𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩} ↔ ∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥)))
32	28, 30, 31	syl2an 608	. . . . 5 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → (𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩} ↔ ∀𝑥 ∈ {𝐴, 𝐵} (𝐹‘𝑥) = ({⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}‘𝑥)))
33	27, 32	mpbird 260	. . . 4 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → 𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩})
34		opeq2 4840	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝐴) → ⟨𝐴, 𝑥⟩ = ⟨𝐴, (𝐹‘𝐴)⟩)
35	34	preq1d 4696	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝐴) → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, 𝑦⟩})
36	35	eqeq2d 2771	. . . . 5 ⊢ (𝑥 = (𝐹‘𝐴) → (𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} ↔ 𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, 𝑦⟩}))
37		opeq2 4840	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝐵) → ⟨𝐵, 𝑦⟩ = ⟨𝐵, (𝐹‘𝐵)⟩)
38	37	preq2d 4697	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝐵) → {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, 𝑦⟩} = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩})
39	38	eqeq2d 2771	. . . . 5 ⊢ (𝑦 = (𝐹‘𝐵) → (𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, 𝑦⟩} ↔ 𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}))
40	36, 39	rspc2ev 3588	. . . 4 ⊢ (((𝐹‘𝐴) ∈ 𝑅 ∧ (𝐹‘𝐵) ∈ 𝑅 ∧ 𝐹 = {⟨𝐴, (𝐹‘𝐴)⟩, ⟨𝐵, (𝐹‘𝐵)⟩}) → ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩})
41	5, 10, 33, 40	syl3anc 1398	. . 3 ⊢ ((𝐹:{𝐴, 𝐵}⟶𝑅 ∧ 𝐴 ≠ 𝐵) → ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩})
42	41	expcom 419	. 2 ⊢ (𝐴 ≠ 𝐵 → (𝐹:{𝐴, 𝐵}⟶𝑅 → ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}))
43		vex 3454	. . . . . . 7 ⊢ 𝑥 ∈ V
44		vex 3454	. . . . . . 7 ⊢ 𝑦 ∈ V
45	1, 6, 43, 44	fpr 7159	. . . . . 6 ⊢ (𝐴 ≠ 𝐵 → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶{𝑥, 𝑦})
46		prssi 4776	. . . . . 6 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑅) → {𝑥, 𝑦} ⊆ 𝑅)
47		fss 6727	. . . . . 6 ⊢ (({⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶{𝑥, 𝑦} ∧ {𝑥, 𝑦} ⊆ 𝑅) → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅)
48	45, 46, 47	syl2an 608	. . . . 5 ⊢ ((𝐴 ≠ 𝐵 ∧ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑅)) → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅)
49	48	ex 418	. . . 4 ⊢ (𝐴 ≠ 𝐵 → ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑅) → {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅))
50		feq1 6688	. . . . 5 ⊢ (𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} → (𝐹:{𝐴, 𝐵}⟶𝑅 ↔ {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅))
51	50	biimprcd 253	. . . 4 ⊢ ({⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}:{𝐴, 𝐵}⟶𝑅 → (𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} → 𝐹:{𝐴, 𝐵}⟶𝑅))
52	49, 51	syl6 36	. . 3 ⊢ (𝐴 ≠ 𝐵 → ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑅) → (𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} → 𝐹:{𝐴, 𝐵}⟶𝑅)))
53	52	rexlimdvv 3218	. 2 ⊢ (𝐴 ≠ 𝐵 → (∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩} → 𝐹:{𝐴, 𝐵}⟶𝑅))
54	42, 53	impbid 215	1 ⊢ (𝐴 ≠ 𝐵 → (𝐹:{𝐴, 𝐵}⟶𝑅 ↔ ∃𝑥 ∈ 𝑅 ∃𝑦 ∈ 𝑅 𝐹 = {⟨𝐴, 𝑥⟩, ⟨𝐵, 𝑦⟩}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895  {cpr 4586  ⟨cop 4834   Fn wfn 6534  ⟶wf 6535  ‘cfv 6539

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-fv 6547

This theorem is used by:  2arymaptf1  49859