Theorem paireqne 48593

Description: Two sets are not equal iff there is exactly one proper pair whose elements are either one of these sets. (Contributed by AV, 27-Jan-2023.)

Hypotheses

Ref	Expression
paireqne.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
paireqne.b	⊢ (𝜑 → 𝐵 ∈ 𝑉)
paireqne.p	⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}

Assertion

Ref	Expression
paireqne	⊢ (𝜑 → (∃!𝑝 ∈ 𝑃 ∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ 𝐴 ≠ 𝐵))

Distinct variable groups:   𝐴,𝑝,𝑥   𝐵,𝑝,𝑥   𝑃,𝑝,𝑥   𝑥,𝑉   𝜑,𝑝,𝑥

Allowed substitution hint:   𝑉(𝑝)

Proof of Theorem paireqne

Dummy variables 𝑎 𝑏 𝑞 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		raleq 3316	. . . 4 ⊢ (𝑝 = 𝑞 → (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
2	1	reu8 3690	. . 3 ⊢ (∃!𝑝 ∈ 𝑃 ∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∃𝑝 ∈ 𝑃 (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)))
3		paireqne.p	. . . . . . . 8 ⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2}
4	3	eleq2i 2852	. . . . . . 7 ⊢ (𝑝 ∈ 𝑃 ↔ 𝑝 ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2})
5		elss2prb 14633	. . . . . . 7 ⊢ (𝑝 ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏}))
6	4, 5	bitri 278	. . . . . 6 ⊢ (𝑝 ∈ 𝑃 ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏}))
7		raleq 3316	. . . . . . . . . . . 12 ⊢ (𝑝 = {𝑎, 𝑏} → (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∀𝑥 ∈ {𝑎, 𝑏} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
8		vex 3454	. . . . . . . . . . . . 13 ⊢ 𝑎 ∈ V
9		vex 3454	. . . . . . . . . . . . 13 ⊢ 𝑏 ∈ V
10		eqeq1 2764	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑎 → (𝑥 = 𝐴 ↔ 𝑎 = 𝐴))
11		eqeq1 2764	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑎 → (𝑥 = 𝐵 ↔ 𝑎 = 𝐵))
12	10, 11	orbi12d 932	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ (𝑎 = 𝐴 ∨ 𝑎 = 𝐵)))
13		eqeq1 2764	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑏 → (𝑥 = 𝐴 ↔ 𝑏 = 𝐴))
14		eqeq1 2764	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑏 → (𝑥 = 𝐵 ↔ 𝑏 = 𝐵))
15	13, 14	orbi12d 932	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑏 → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)))
16	8, 9, 12, 15	ralpr 4660	. . . . . . . . . . . 12 ⊢ (∀𝑥 ∈ {𝑎, 𝑏} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)))
17	7, 16	bitrdi 290	. . . . . . . . . . 11 ⊢ (𝑝 = {𝑎, 𝑏} → (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))))
18		eqeq1 2764	. . . . . . . . . . . . 13 ⊢ (𝑝 = {𝑎, 𝑏} → (𝑝 = 𝑞 ↔ {𝑎, 𝑏} = 𝑞))
19	18	imbi2d 343	. . . . . . . . . . . 12 ⊢ (𝑝 = {𝑎, 𝑏} → ((∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞) ↔ (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞)))
20	19	ralbidv 3185	. . . . . . . . . . 11 ⊢ (𝑝 = {𝑎, 𝑏} → (∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞) ↔ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞)))
21	17, 20	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑝 = {𝑎, 𝑏} → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)) ↔ (((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞))))
22	21	ad2antll 742	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)) ↔ (((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞))))
23		paireqne.a	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
24		paireqne.b	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐵 ∈ 𝑉)
25	23, 24	jca 521	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉))
26		prelpwi 5414	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → {𝐴, 𝐵} ∈ 𝒫 𝑉)
27	25, 26	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → {𝐴, 𝐵} ∈ 𝒫 𝑉)
28	27	ad3antrrr 743	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → {𝐴, 𝐵} ∈ 𝒫 𝑉)
29		hashprg 14539	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → (𝑎 ≠ 𝑏 ↔ (♯‘{𝑎, 𝑏}) = 2))
30	29	adantl 487	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎 ≠ 𝑏 ↔ (♯‘{𝑎, 𝑏}) = 2))
31	30	biimpd 232	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎 ≠ 𝑏 → (♯‘{𝑎, 𝑏}) = 2))
32	31	com12 33	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ≠ 𝑏 → ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (♯‘{𝑎, 𝑏}) = 2))
33	32	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏}) → ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (♯‘{𝑎, 𝑏}) = 2))
34	33	impcom 413	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → (♯‘{𝑎, 𝑏}) = 2)
35	34	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → (♯‘{𝑎, 𝑏}) = 2)
36		eqtr3 2782	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑏 = 𝐴 ∧ 𝑎 = 𝐴) → 𝑏 = 𝑎)
37		eqneqall 2966	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑎 = 𝑏 → (𝑎 ≠ 𝑏 → (𝑝 = {𝑎, 𝑏} → {𝐴, 𝐵} = {𝑎, 𝑏})))
38	37	impd 416	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑎 = 𝑏 → ((𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏}) → {𝐴, 𝐵} = {𝑎, 𝑏}))
39	38	a1d 26	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑎 = 𝑏 → ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ((𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏}) → {𝐴, 𝐵} = {𝑎, 𝑏})))
40	39	impd 416	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑎 = 𝑏 → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏}))
41	40	equcoms 2052	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑏 = 𝑎 → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏}))
42	36, 41	syl 18	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑏 = 𝐴 ∧ 𝑎 = 𝐴) → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏}))
43	42	ex 418	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑏 = 𝐴 → (𝑎 = 𝐴 → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
44		preq12 4695	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → {𝑎, 𝑏} = {𝐴, 𝐵})
45	44	eqcomd 2766	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → {𝐴, 𝐵} = {𝑎, 𝑏})
46	45	a1d 26	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏}))
47	46	expcom 419	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑏 = 𝐵 → (𝑎 = 𝐴 → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
48	43, 47	jaoi 871	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) → (𝑎 = 𝐴 → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
49	48	com12 33	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝐴 → ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
50		prcom 4692	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ {𝑎, 𝑏} = {𝑏, 𝑎}
51		preq12 4695	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑏 = 𝐴 ∧ 𝑎 = 𝐵) → {𝑏, 𝑎} = {𝐴, 𝐵})
52	50, 51	eqtrid 2807	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑏 = 𝐴 ∧ 𝑎 = 𝐵) → {𝑎, 𝑏} = {𝐴, 𝐵})
53	52	eqcomd 2766	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑏 = 𝐴 ∧ 𝑎 = 𝐵) → {𝐴, 𝐵} = {𝑎, 𝑏})
54	53	a1d 26	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑏 = 𝐴 ∧ 𝑎 = 𝐵) → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏}))
55	54	ex 418	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑏 = 𝐴 → (𝑎 = 𝐵 → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
56		eqtr3 2782	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑏 = 𝐵 ∧ 𝑎 = 𝐵) → 𝑏 = 𝑎)
57	56, 41	syl 18	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑏 = 𝐵 ∧ 𝑎 = 𝐵) → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏}))
58	57	ex 418	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑏 = 𝐵 → (𝑎 = 𝐵 → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
59	55, 58	jaoi 871	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) → (𝑎 = 𝐵 → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
60	59	com12 33	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝐵 → ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
61	49, 60	jaoi 871	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) → ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏})))
62	61	imp 412	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)) → (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → {𝐴, 𝐵} = {𝑎, 𝑏}))
63	62	impcom 413	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → {𝐴, 𝐵} = {𝑎, 𝑏})
64	63	fveqeq2d 6893	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → ((♯‘{𝐴, 𝐵}) = 2 ↔ (♯‘{𝑎, 𝑏}) = 2))
65	35, 64	mpbird 260	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → (♯‘{𝐴, 𝐵}) = 2)
66	28, 65	jca 521	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → ({𝐴, 𝐵} ∈ 𝒫 𝑉 ∧ (♯‘{𝐴, 𝐵}) = 2))
67	3	eleq2i 2852	. . . . . . . . . . . . . . 15 ⊢ ({𝐴, 𝐵} ∈ 𝑃 ↔ {𝐴, 𝐵} ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2})
68		fveqeq2 6894	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = {𝐴, 𝐵} → ((♯‘𝑥) = 2 ↔ (♯‘{𝐴, 𝐵}) = 2))
69	68	elrab 3644	. . . . . . . . . . . . . . 15 ⊢ ({𝐴, 𝐵} ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} ↔ ({𝐴, 𝐵} ∈ 𝒫 𝑉 ∧ (♯‘{𝐴, 𝐵}) = 2))
70	67, 69	bitri 278	. . . . . . . . . . . . . 14 ⊢ ({𝐴, 𝐵} ∈ 𝑃 ↔ ({𝐴, 𝐵} ∈ 𝒫 𝑉 ∧ (♯‘{𝐴, 𝐵}) = 2))
71	66, 70	sylibr 237	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → {𝐴, 𝐵} ∈ 𝑃)
72		raleq 3316	. . . . . . . . . . . . . . 15 ⊢ (𝑞 = {𝐴, 𝐵} → (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
73		eqeq2 2772	. . . . . . . . . . . . . . 15 ⊢ (𝑞 = {𝐴, 𝐵} → ({𝑎, 𝑏} = 𝑞 ↔ {𝑎, 𝑏} = {𝐴, 𝐵}))
74	72, 73	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑞 = {𝐴, 𝐵} → ((∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞) ↔ (∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = {𝐴, 𝐵})))
75	74	rspcv 3572	. . . . . . . . . . . . 13 ⊢ ({𝐴, 𝐵} ∈ 𝑃 → (∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞) → (∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = {𝐴, 𝐵})))
76	71, 75	syl 18	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → (∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞) → (∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = {𝐴, 𝐵})))
77		eqeq1 2764	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐴 ↔ 𝐴 = 𝐴))
78		eqeq1 2764	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐵 ↔ 𝐴 = 𝐵))
79	77, 78	orbi12d 932	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ (𝐴 = 𝐴 ∨ 𝐴 = 𝐵)))
80		eqeq1 2764	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝐵 → (𝑥 = 𝐴 ↔ 𝐵 = 𝐴))
81		eqeq1 2764	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝐵 → (𝑥 = 𝐵 ↔ 𝐵 = 𝐵))
82	80, 81	orbi12d 932	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝐵 → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)))
83	79, 82	ralprg 4656	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵))))
84	25, 83	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵))))
85	84	imbi1d 344	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = {𝐴, 𝐵}) ↔ (((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)) → {𝑎, 𝑏} = {𝐴, 𝐵})))
86	85	ad3antrrr 743	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → ((∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = {𝐴, 𝐵}) ↔ (((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)) → {𝑎, 𝑏} = {𝐴, 𝐵})))
87		eqid 2760	. . . . . . . . . . . . . . . 16 ⊢ 𝐴 = 𝐴
88	87	orci 879	. . . . . . . . . . . . . . 15 ⊢ (𝐴 = 𝐴 ∨ 𝐴 = 𝐵)
89		eqid 2760	. . . . . . . . . . . . . . . 16 ⊢ 𝐵 = 𝐵
90	89	olci 880	. . . . . . . . . . . . . . 15 ⊢ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)
91		pm5.5 364	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)) → ((((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)) → {𝑎, 𝑏} = {𝐴, 𝐵}) ↔ {𝑎, 𝑏} = {𝐴, 𝐵}))
92	88, 90, 91	mp2an 705	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)) → {𝑎, 𝑏} = {𝐴, 𝐵}) ↔ {𝑎, 𝑏} = {𝐴, 𝐵})
93	8, 9	pm3.2i 476	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ V ∧ 𝑏 ∈ V)
94		preq12bg 4812	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑎 ∈ V ∧ 𝑏 ∈ V) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) → ({𝑎, 𝑏} = {𝐴, 𝐵} ↔ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∨ (𝑎 = 𝐵 ∧ 𝑏 = 𝐴))))
95	93, 25, 94	sylancr 599	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → ({𝑎, 𝑏} = {𝐴, 𝐵} ↔ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∨ (𝑎 = 𝐵 ∧ 𝑏 = 𝐴))))
96	95	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ({𝑎, 𝑏} = {𝐴, 𝐵} ↔ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∨ (𝑎 = 𝐵 ∧ 𝑏 = 𝐴))))
97	96	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → ({𝑎, 𝑏} = {𝐴, 𝐵} ↔ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∨ (𝑎 = 𝐵 ∧ 𝑏 = 𝐴))))
98		eqeq12 2777	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (𝑎 = 𝑏 ↔ 𝐴 = 𝐵))
99	98	necon3bid 2999	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (𝑎 ≠ 𝑏 ↔ 𝐴 ≠ 𝐵))
100	99	biimpd 232	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → (𝑎 ≠ 𝑏 → 𝐴 ≠ 𝐵))
101		eqeq12 2777	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐴) → (𝑎 = 𝑏 ↔ 𝐵 = 𝐴))
102	101	necon3bid 2999	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐴) → (𝑎 ≠ 𝑏 ↔ 𝐵 ≠ 𝐴))
103	102	biimpd 232	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐴) → (𝑎 ≠ 𝑏 → 𝐵 ≠ 𝐴))
104		necom 3008	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴)
105	103, 104	imbitrrdi 255	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐴) → (𝑎 ≠ 𝑏 → 𝐴 ≠ 𝐵))
106	100, 105	jaoi 871	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∨ (𝑎 = 𝐵 ∧ 𝑏 = 𝐴)) → (𝑎 ≠ 𝑏 → 𝐴 ≠ 𝐵))
107	106	com12 33	. . . . . . . . . . . . . . . . 17 ⊢ (𝑎 ≠ 𝑏 → (((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∨ (𝑎 = 𝐵 ∧ 𝑏 = 𝐴)) → 𝐴 ≠ 𝐵))
108	107	ad2antrl 741	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → (((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) ∨ (𝑎 = 𝐵 ∧ 𝑏 = 𝐴)) → 𝐴 ≠ 𝐵))
109	97, 108	sylbid 243	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → ({𝑎, 𝑏} = {𝐴, 𝐵} → 𝐴 ≠ 𝐵))
110	109	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → ({𝑎, 𝑏} = {𝐴, 𝐵} → 𝐴 ≠ 𝐵))
111	92, 110	biimtrid 245	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → ((((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ∧ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)) → {𝑎, 𝑏} = {𝐴, 𝐵}) → 𝐴 ≠ 𝐵))
112	86, 111	sylbid 243	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → ((∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = {𝐴, 𝐵}) → 𝐴 ≠ 𝐵))
113	76, 112	syld 48	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) ∧ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵))) → (∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞) → 𝐴 ≠ 𝐵))
114	113	ex 418	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → (((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)) → (∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞) → 𝐴 ≠ 𝐵)))
115	114	impd 416	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → ((((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) ∧ (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝑎, 𝑏} = 𝑞)) → 𝐴 ≠ 𝐵))
116	22, 115	sylbid 243	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏})) → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)) → 𝐴 ≠ 𝐵))
117	116	ex 418	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ((𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏}) → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)) → 𝐴 ≠ 𝐵)))
118	117	rexlimdvva 3219	. . . . . 6 ⊢ (𝜑 → (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑎 ≠ 𝑏 ∧ 𝑝 = {𝑎, 𝑏}) → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)) → 𝐴 ≠ 𝐵)))
119	6, 118	biimtrid 245	. . . . 5 ⊢ (𝜑 → (𝑝 ∈ 𝑃 → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)) → 𝐴 ≠ 𝐵)))
120	119	imp 412	. . . 4 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝑃) → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)) → 𝐴 ≠ 𝐵))
121	120	rexlimdva 3163	. . 3 ⊢ (𝜑 → (∃𝑝 ∈ 𝑃 (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑞 ∈ 𝑃 (∀𝑥 ∈ 𝑞 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑞)) → 𝐴 ≠ 𝐵))
122	2, 121	biimtrid 245	. 2 ⊢ (𝜑 → (∃!𝑝 ∈ 𝑃 ∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝐴 ≠ 𝐵))
123	27	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ∈ 𝒫 𝑉)
124		hashprg 14539	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 ≠ 𝐵 ↔ (♯‘{𝐴, 𝐵}) = 2))
125	25, 124	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ (♯‘{𝐴, 𝐵}) = 2))
126	125	biimpd 232	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ≠ 𝐵 → (♯‘{𝐴, 𝐵}) = 2))
127	126	imp 412	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (♯‘{𝐴, 𝐵}) = 2)
128	123, 127	jca 521	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ({𝐴, 𝐵} ∈ 𝒫 𝑉 ∧ (♯‘{𝐴, 𝐵}) = 2))
129	128, 70	sylibr 237	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → {𝐴, 𝐵} ∈ 𝑃)
130		raleq 3316	. . . . . . 7 ⊢ (𝑝 = {𝐴, 𝐵} → (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
131		eqeq1 2764	. . . . . . . . 9 ⊢ (𝑝 = {𝐴, 𝐵} → (𝑝 = 𝑦 ↔ {𝐴, 𝐵} = 𝑦))
132	131	imbi2d 343	. . . . . . . 8 ⊢ (𝑝 = {𝐴, 𝐵} → ((∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑦) ↔ (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦)))
133	132	ralbidv 3185	. . . . . . 7 ⊢ (𝑝 = {𝐴, 𝐵} → (∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑦) ↔ ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦)))
134	130, 133	anbi12d 644	. . . . . 6 ⊢ (𝑝 = {𝐴, 𝐵} → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑦)) ↔ (∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦))))
135	134	adantl 487	. . . . 5 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑝 = {𝐴, 𝐵}) → ((∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑦)) ↔ (∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦))))
136		vex 3454	. . . . . . . . 9 ⊢ 𝑥 ∈ V
137	136	elpr 4608	. . . . . . . 8 ⊢ (𝑥 ∈ {𝐴, 𝐵} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
138	137	bilani 510	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑥 ∈ {𝐴, 𝐵}) → (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
139	138	ralrimiva 3154	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
140	3	eleq2i 2852	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝑃 ↔ 𝑦 ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2})
141		elss2prb 14633	. . . . . . . . . 10 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏}))
142	140, 141	bitri 278	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝑃 ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏}))
143		prid1g 4720	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 ∈ 𝑉 → 𝑎 ∈ {𝑎, 𝑏})
144	143	ad2antrl 741	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → 𝑎 ∈ {𝑎, 𝑏})
145	144	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → 𝑎 ∈ {𝑎, 𝑏})
146		eleq2 2849	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = {𝑎, 𝑏} → (𝑎 ∈ 𝑦 ↔ 𝑎 ∈ {𝑎, 𝑏}))
147	146	ad2antll 742	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → (𝑎 ∈ 𝑦 ↔ 𝑎 ∈ {𝑎, 𝑏}))
148	145, 147	mpbird 260	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → 𝑎 ∈ 𝑦)
149	12	rspcv 3572	. . . . . . . . . . . . 13 ⊢ (𝑎 ∈ 𝑦 → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (𝑎 = 𝐴 ∨ 𝑎 = 𝐵)))
150	148, 149	syl 18	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (𝑎 = 𝐴 ∨ 𝑎 = 𝐵)))
151		prid2g 4721	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 ∈ 𝑉 → 𝑏 ∈ {𝑎, 𝑏})
152	151	ad2antll 742	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → 𝑏 ∈ {𝑎, 𝑏})
153	152	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → 𝑏 ∈ {𝑎, 𝑏})
154		eleq2 2849	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = {𝑎, 𝑏} → (𝑏 ∈ 𝑦 ↔ 𝑏 ∈ {𝑎, 𝑏}))
155	154	ad2antll 742	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → (𝑏 ∈ 𝑦 ↔ 𝑏 ∈ {𝑎, 𝑏}))
156	153, 155	mpbird 260	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → 𝑏 ∈ 𝑦)
157	15	rspcv 3572	. . . . . . . . . . . . . 14 ⊢ (𝑏 ∈ 𝑦 → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)))
158	156, 157	syl 18	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (𝑏 = 𝐴 ∨ 𝑏 = 𝐵)))
159		simplrr 790	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) ∧ ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) ∧ (𝑎 = 𝐴 ∨ 𝑎 = 𝐵))) → 𝑦 = {𝑎, 𝑏})
160		eqtr3 2782	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐴) → 𝑎 = 𝑏)
161		eqneqall 2966	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑎 = 𝑏 → (𝑎 ≠ 𝑏 → {𝑎, 𝑏} = {𝐴, 𝐵}))
162	161	com12 33	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑎 ≠ 𝑏 → (𝑎 = 𝑏 → {𝑎, 𝑏} = {𝐴, 𝐵}))
163	162	ad2antrl 741	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → (𝑎 = 𝑏 → {𝑎, 𝑏} = {𝐴, 𝐵}))
164	163	com12 33	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑎 = 𝑏 → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵}))
165	160, 164	syl 18	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐴) → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵}))
166	165	ex 418	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝐴 → (𝑏 = 𝐴 → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
167	52	a1d 26	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑏 = 𝐴 ∧ 𝑎 = 𝐵) → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵}))
168	167	expcom 419	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝐵 → (𝑏 = 𝐴 → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
169	166, 168	jaoi 871	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) → (𝑏 = 𝐴 → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
170	169	com12 33	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝐴 → ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
171	44	a1d 26	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵) → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵}))
172	171	ex 418	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝐴 → (𝑏 = 𝐵 → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
173		eqtr3 2782	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐵) → 𝑎 = 𝑏)
174	173, 164	syl 18	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎 = 𝐵 ∧ 𝑏 = 𝐵) → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵}))
175	174	ex 418	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝐵 → (𝑏 = 𝐵 → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
176	172, 175	jaoi 871	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) → (𝑏 = 𝐵 → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
177	176	com12 33	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝐵 → ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
178	170, 177	jaoi 871	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) → ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵})))
179	178	imp 412	. . . . . . . . . . . . . . . 16 ⊢ (((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) ∧ (𝑎 = 𝐴 ∨ 𝑎 = 𝐵)) → ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → {𝑎, 𝑏} = {𝐴, 𝐵}))
180	179	impcom 413	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) ∧ ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) ∧ (𝑎 = 𝐴 ∨ 𝑎 = 𝐵))) → {𝑎, 𝑏} = {𝐴, 𝐵})
181	159, 180	eqtr2d 2796	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) ∧ ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) ∧ (𝑎 = 𝐴 ∨ 𝑎 = 𝐵))) → {𝐴, 𝐵} = 𝑦)
182	181	exp32 426	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → ((𝑏 = 𝐴 ∨ 𝑏 = 𝐵) → ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) → {𝐴, 𝐵} = 𝑦)))
183	158, 182	syld 48	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → ((𝑎 = 𝐴 ∨ 𝑎 = 𝐵) → {𝐴, 𝐵} = 𝑦)))
184	150, 183	mpdd 44	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏})) → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦))
185	184	ex 418	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ((𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏}) → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦)))
186	185	rexlimdvva 3219	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑎 ≠ 𝑏 ∧ 𝑦 = {𝑎, 𝑏}) → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦)))
187	142, 186	biimtrid 245	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (𝑦 ∈ 𝑃 → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦)))
188	187	imp 412	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐴 ≠ 𝐵) ∧ 𝑦 ∈ 𝑃) → (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦))
189	188	ralrimiva 3154	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦))
190	139, 189	jca 521	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → (∀𝑥 ∈ {𝐴, 𝐵} (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → {𝐴, 𝐵} = 𝑦)))
191	129, 135, 190	rspcedvd 3578	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ∃𝑝 ∈ 𝑃 (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑦)))
192		raleq 3316	. . . . 5 ⊢ (𝑝 = 𝑦 → (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
193	192	reu8 3690	. . . 4 ⊢ (∃!𝑝 ∈ 𝑃 ∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∃𝑝 ∈ 𝑃 (∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑃 (∀𝑥 ∈ 𝑦 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑝 = 𝑦)))
194	191, 193	sylibr 237	. . 3 ⊢ ((𝜑 ∧ 𝐴 ≠ 𝐵) → ∃!𝑝 ∈ 𝑃 ∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
195	194	ex 418	. 2 ⊢ (𝜑 → (𝐴 ≠ 𝐵 → ∃!𝑝 ∈ 𝑃 ∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
196	122, 195	impbid 215	1 ⊢ (𝜑 → (∃!𝑝 ∈ 𝑃 ∀𝑥 ∈ 𝑝 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ 𝐴 ≠ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  ∃!wreu 3363  {crab 3412  Vcvv 3450  𝒫 cpw 4556  {cpr 4585  ‘cfv 6538  2c2 12397  ♯chash 14474

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-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  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-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-2o 8477  df-oadd 8480  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-dju 9982  df-card 10020  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-nn 12336  df-2 12405  df-n0 12607  df-z 12694  df-uz 12966  df-fz 13640  df-hash 14475

This theorem is used by:  requad2  48721