Theorem or2expropbi 47148

Description: If two classes are strictly ordered, there is an ordered pair of both classes fulfilling a wff iff there is an unordered pair of both classes fulfilling the wff. (Contributed by AV, 26-Aug-2023.)

Assertion

Ref	Expression
or2expropbi	⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (∃𝑎∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑)) ↔ ∃𝑎∃𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏 ∧ 𝜑))))

Distinct variable groups:   𝑎,𝑏,𝐴   𝐵,𝑎,𝑏   𝑅,𝑎,𝑏   𝑉,𝑎,𝑏   𝑋,𝑎,𝑏

Allowed substitution hints:   𝜑(𝑎,𝑏)

Proof of Theorem or2expropbi

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

Step	Hyp	Ref	Expression
1		nfv 1915	. . . 4 ⊢ Ⅎ𝑎((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵))
2		nfv 1915	. . . . . . 7 ⊢ Ⅎ𝑎⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩
3		nfcv 2896	. . . . . . . 8 ⊢ Ⅎ𝑎𝑦
4		nfsbc1v 3758	. . . . . . . 8 ⊢ Ⅎ𝑎[𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)
5	3, 4	nfsbcw 3760	. . . . . . 7 ⊢ Ⅎ𝑎[𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)
6	2, 5	nfan 1900	. . . . . 6 ⊢ Ⅎ𝑎(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))
7	6	nfex 2327	. . . . 5 ⊢ Ⅎ𝑎∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))
8	7	nfex 2327	. . . 4 ⊢ Ⅎ𝑎∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))
9		nfv 1915	. . . . 5 ⊢ Ⅎ𝑏((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵))
10		nfv 1915	. . . . . . . 8 ⊢ Ⅎ𝑏⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩
11		nfsbc1v 3758	. . . . . . . 8 ⊢ Ⅎ𝑏[𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)
12	10, 11	nfan 1900	. . . . . . 7 ⊢ Ⅎ𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))
13	12	nfex 2327	. . . . . 6 ⊢ Ⅎ𝑏∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))
14	13	nfex 2327	. . . . 5 ⊢ Ⅎ𝑏∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))
15		vex 3442	. . . . . . . . . 10 ⊢ 𝑎 ∈ V
16		vex 3442	. . . . . . . . . 10 ⊢ 𝑏 ∈ V
17		preq12bg 4806	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑎 ∈ V ∧ 𝑏 ∈ V)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎 ∧ 𝐵 = 𝑏) ∨ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎))))
18	15, 16, 17	mpanr12 705	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎 ∧ 𝐵 = 𝑏) ∨ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎))))
19	18	3adant3 1132	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎 ∧ 𝐵 = 𝑏) ∨ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎))))
20	19	adantl 481	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ↔ ((𝐴 = 𝑎 ∧ 𝐵 = 𝑏) ∨ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎))))
21		or2expropbilem1 47146	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴 = 𝑎 ∧ 𝐵 = 𝑏) → ((𝑎𝑅𝑏 ∧ 𝜑) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
22	21	3adant3 1132	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵) → ((𝐴 = 𝑎 ∧ 𝐵 = 𝑏) → ((𝑎𝑅𝑏 ∧ 𝜑) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
23	22	adantl 481	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → ((𝐴 = 𝑎 ∧ 𝐵 = 𝑏) → ((𝑎𝑅𝑏 ∧ 𝜑) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
24		breq12 5100	. . . . . . . . . . . . 13 ⊢ ((𝐵 = 𝑎 ∧ 𝐴 = 𝑏) → (𝐵𝑅𝐴 ↔ 𝑎𝑅𝑏))
25	24	ancoms 458	. . . . . . . . . . . 12 ⊢ ((𝐴 = 𝑏 ∧ 𝐵 = 𝑎) → (𝐵𝑅𝐴 ↔ 𝑎𝑅𝑏))
26	25	adantl 481	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎)) → (𝐵𝑅𝐴 ↔ 𝑎𝑅𝑏))
27		soasym 5562	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 Or 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴))
28	27	ex 412	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 Or 𝑋 → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴)))
29	28	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴)))
30	29	expd 415	. . . . . . . . . . . . . 14 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) → (𝐴 ∈ 𝑋 → (𝐵 ∈ 𝑋 → (𝐴𝑅𝐵 → ¬ 𝐵𝑅𝐴))))
31	30	3imp2 1350	. . . . . . . . . . . . 13 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → ¬ 𝐵𝑅𝐴)
32	31	pm2.21d 121	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (𝐵𝑅𝐴 → (𝜑 → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
33	32	adantr 480	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎)) → (𝐵𝑅𝐴 → (𝜑 → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
34	26, 33	sylbird 260	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎)) → (𝑎𝑅𝑏 → (𝜑 → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
35	34	impd 410	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) ∧ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎)) → ((𝑎𝑅𝑏 ∧ 𝜑) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))))
36	35	ex 412	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → ((𝐴 = 𝑏 ∧ 𝐵 = 𝑎) → ((𝑎𝑅𝑏 ∧ 𝜑) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
37	23, 36	jaod 859	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (((𝐴 = 𝑎 ∧ 𝐵 = 𝑏) ∨ (𝐴 = 𝑏 ∧ 𝐵 = 𝑎)) → ((𝑎𝑅𝑏 ∧ 𝜑) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
38	20, 37	sylbid 240	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → ({𝐴, 𝐵} = {𝑎, 𝑏} → ((𝑎𝑅𝑏 ∧ 𝜑) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))))
39	38	impd 410	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑)) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))))
40	9, 14, 39	exlimd 2223	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑)) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))))
41	1, 8, 40	exlimd 2223	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (∃𝑎∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑)) → ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑))))
42		or2expropbilem2 47147	. . 3 ⊢ (∃𝑎∃𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏 ∧ 𝜑)) ↔ ∃𝑥∃𝑦(⟨𝐴, 𝐵⟩ = ⟨𝑥, 𝑦⟩ ∧ [𝑦 / 𝑏][𝑥 / 𝑎](𝑎𝑅𝑏 ∧ 𝜑)))
43	41, 42	imbitrrdi 252	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (∃𝑎∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑)) → ∃𝑎∃𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏 ∧ 𝜑))))
44		oppr 47144	. . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ → {𝐴, 𝐵} = {𝑎, 𝑏}))
45	44	anim1d 611	. . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏 ∧ 𝜑)) → ({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑))))
46	45	2eximdv 1920	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∃𝑎∃𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏 ∧ 𝜑)) → ∃𝑎∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑))))
47	46	3adant3 1132	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵) → (∃𝑎∃𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏 ∧ 𝜑)) → ∃𝑎∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑))))
48	47	adantl 481	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (∃𝑎∃𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏 ∧ 𝜑)) → ∃𝑎∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑))))
49	43, 48	impbid 212	1 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑅 Or 𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐴𝑅𝐵)) → (∃𝑎∃𝑏({𝐴, 𝐵} = {𝑎, 𝑏} ∧ (𝑎𝑅𝑏 ∧ 𝜑)) ↔ ∃𝑎∃𝑏(⟨𝐴, 𝐵⟩ = ⟨𝑎, 𝑏⟩ ∧ (𝑎𝑅𝑏 ∧ 𝜑))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1541  ∃wex 1780   ∈ wcel 2113  Vcvv 3438  [wsbc 3738  {cpr 4579  ⟨cop 4583   class class class wbr 5095   Or wor 5528

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ral 3050  df-rab 3398  df-v 3440  df-sbc 3739  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-br 5096  df-po 5529  df-so 5530

This theorem is referenced by: (None)