canthwelem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > canthwelem		Structured version Visualization version GIF version

Theorem canthwelem 10662

Description: Lemma for canthwe 10663. (Contributed by Mario Carneiro, 31-May-2015.)

**Hypotheses**
Ref	Expression
canthwe.1	⊢ 𝑂 = {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)}
canthwe.2	⊢ 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(^◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))}
canthwe.3	⊢ 𝐵 = ∪ dom 𝑊
canthwe.4	⊢ 𝐶 = (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))})

**Assertion**
Ref	Expression
canthwelem	⊢ (𝐴 ∈ 𝑉 → ¬ 𝐹:𝑂–1-1→𝐴)

Distinct variable groups: 𝑢,𝑟,𝑥,𝑦,𝐵 𝐶,𝑟,𝑥 𝑂,𝑟,𝑢,𝑥,𝑦 𝑉,𝑟,𝑢,𝑥,𝑦 𝐴,𝑟,𝑢,𝑥,𝑦 𝐹,𝑟,𝑢,𝑥,𝑦 𝑊,𝑟,𝑢,𝑥,𝑦 Allowed substitution hints: 𝐶(𝑦,𝑢)

**Proof of Theorem canthwelem**
Step	Hyp	Ref	Expression
1		eqid 2735	. . . . . . . 8 ⊢ 𝐵 = 𝐵
2		eqid 2735	. . . . . . . 8 ⊢ (𝑊‘𝐵) = (𝑊‘𝐵)
3	1, 2	pm3.2i 470	. . . . . . 7 ⊢ (𝐵 = 𝐵 ∧ (𝑊‘𝐵) = (𝑊‘𝐵))
4		canthwe.2	. . . . . . . 8 ⊢ 𝑊 = {⟨𝑥, 𝑟⟩ ∣ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥)) ∧ (𝑟 We 𝑥 ∧ ∀𝑦 ∈ 𝑥 [(^◡𝑟 “ {𝑦}) / 𝑢](𝑢𝐹(𝑟 ∩ (𝑢 × 𝑢))) = 𝑦))}
5		simpl 482	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → 𝐴 ∈ 𝑉)
6		df-ov 7406	. . . . . . . . 9 ⊢ (𝑥𝐹𝑟) = (𝐹‘⟨𝑥, 𝑟⟩)
7		f1f 6773	. . . . . . . . . . 11 ⊢ (𝐹:𝑂–1-1→𝐴 → 𝐹:𝑂⟶𝐴)
8	7	ad2antlr 727	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → 𝐹:𝑂⟶𝐴)
9		simpr 484	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥))
10		opabidw 5499	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑟⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)} ↔ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥))
11	9, 10	sylibr 234	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → ⟨𝑥, 𝑟⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)})
12		canthwe.1	. . . . . . . . . . 11 ⊢ 𝑂 = {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)}
13	11, 12	eleqtrrdi 2845	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → ⟨𝑥, 𝑟⟩ ∈ 𝑂)
14	8, 13	ffvelcdmd 7074	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝐹‘⟨𝑥, 𝑟⟩) ∈ 𝐴)
15	6, 14	eqeltrid 2838	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) ∧ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)) → (𝑥𝐹𝑟) ∈ 𝐴)
16		canthwe.3	. . . . . . . 8 ⊢ 𝐵 = ∪ dom 𝑊
17	4, 5, 15, 16	fpwwe2 10655	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ((𝐵𝑊(𝑊‘𝐵) ∧ (𝐵𝐹(𝑊‘𝐵)) ∈ 𝐵) ↔ (𝐵 = 𝐵 ∧ (𝑊‘𝐵) = (𝑊‘𝐵))))
18	3, 17	mpbiri 258	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐵𝑊(𝑊‘𝐵) ∧ (𝐵𝐹(𝑊‘𝐵)) ∈ 𝐵))
19	18	simprd 495	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐵𝐹(𝑊‘𝐵)) ∈ 𝐵)
20		canthwe.4	. . . . . . . . . 10 ⊢ 𝐶 = (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))})
21	20, 20	xpeq12i 5682	. . . . . . . . . . 11 ⊢ (𝐶 × 𝐶) = ((^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) × (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}))
22	21	ineq2i 4192	. . . . . . . . . 10 ⊢ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) = ((𝑊‘𝐵) ∩ ((^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) × (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))})))
23	20, 22	oveq12i 7415	. . . . . . . . 9 ⊢ (𝐶𝐹((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) = ((^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))})𝐹((𝑊‘𝐵) ∩ ((^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) × (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}))))
24	18	simpld 494	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → 𝐵𝑊(𝑊‘𝐵))
25	4, 5, 24	fpwwe2lem3 10645	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) ∧ (𝐵𝐹(𝑊‘𝐵)) ∈ 𝐵) → ((^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))})𝐹((𝑊‘𝐵) ∩ ((^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) × (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))})))) = (𝐵𝐹(𝑊‘𝐵)))
26	19, 25	mpdan 687	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ((^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))})𝐹((𝑊‘𝐵) ∩ ((^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) × (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))})))) = (𝐵𝐹(𝑊‘𝐵)))
27	23, 26	eqtrid 2782	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐶𝐹((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) = (𝐵𝐹(𝑊‘𝐵)))
28		df-ov 7406	. . . . . . . 8 ⊢ (𝐶𝐹((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) = (𝐹‘⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩)
29		df-ov 7406	. . . . . . . 8 ⊢ (𝐵𝐹(𝑊‘𝐵)) = (𝐹‘⟨𝐵, (𝑊‘𝐵)⟩)
30	27, 28, 29	3eqtr3g 2793	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐹‘⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩) = (𝐹‘⟨𝐵, (𝑊‘𝐵)⟩))
31		simpr 484	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → 𝐹:𝑂–1-1→𝐴)
32		cnvimass 6069	. . . . . . . . . . . . 13 ⊢ (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) ⊆ dom (𝑊‘𝐵)
33	4, 5	fpwwe2lem2 10644	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐵𝑊(𝑊‘𝐵) ↔ ((𝐵 ⊆ 𝐴 ∧ (𝑊‘𝐵) ⊆ (𝐵 × 𝐵)) ∧ ((𝑊‘𝐵) We 𝐵 ∧ ∀𝑦 ∈ 𝐵 [(^◡(𝑊‘𝐵) “ {𝑦}) / 𝑢](𝑢𝐹((𝑊‘𝐵) ∩ (𝑢 × 𝑢))) = 𝑦))))
34	24, 33	mpbid 232	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ((𝐵 ⊆ 𝐴 ∧ (𝑊‘𝐵) ⊆ (𝐵 × 𝐵)) ∧ ((𝑊‘𝐵) We 𝐵 ∧ ∀𝑦 ∈ 𝐵 [(^◡(𝑊‘𝐵) “ {𝑦}) / 𝑢](𝑢𝐹((𝑊‘𝐵) ∩ (𝑢 × 𝑢))) = 𝑦)))
35	34	simpld 494	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐵 ⊆ 𝐴 ∧ (𝑊‘𝐵) ⊆ (𝐵 × 𝐵)))
36	35	simprd 495	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝑊‘𝐵) ⊆ (𝐵 × 𝐵))
37		dmss 5882	. . . . . . . . . . . . . . 15 ⊢ ((𝑊‘𝐵) ⊆ (𝐵 × 𝐵) → dom (𝑊‘𝐵) ⊆ dom (𝐵 × 𝐵))
38	36, 37	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → dom (𝑊‘𝐵) ⊆ dom (𝐵 × 𝐵))
39		dmxpss 6160	. . . . . . . . . . . . . 14 ⊢ dom (𝐵 × 𝐵) ⊆ 𝐵
40	38, 39	sstrdi 3971	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → dom (𝑊‘𝐵) ⊆ 𝐵)
41	32, 40	sstrid 3970	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) ⊆ 𝐵)
42	20, 41	eqsstrid 3997	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → 𝐶 ⊆ 𝐵)
43	35	simpld 494	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → 𝐵 ⊆ 𝐴)
44	42, 43	sstrd 3969	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → 𝐶 ⊆ 𝐴)
45		inss2 4213	. . . . . . . . . . 11 ⊢ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) ⊆ (𝐶 × 𝐶)
46	45	a1i 11	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) ⊆ (𝐶 × 𝐶))
47	34	simprd 495	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ((𝑊‘𝐵) We 𝐵 ∧ ∀𝑦 ∈ 𝐵 [(^◡(𝑊‘𝐵) “ {𝑦}) / 𝑢](𝑢𝐹((𝑊‘𝐵) ∩ (𝑢 × 𝑢))) = 𝑦))
48	47	simpld 494	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝑊‘𝐵) We 𝐵)
49		wess 5640	. . . . . . . . . . . 12 ⊢ (𝐶 ⊆ 𝐵 → ((𝑊‘𝐵) We 𝐵 → (𝑊‘𝐵) We 𝐶))
50	42, 48, 49	sylc 65	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝑊‘𝐵) We 𝐶)
51		weinxp 5739	. . . . . . . . . . 11 ⊢ ((𝑊‘𝐵) We 𝐶 ↔ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) We 𝐶)
52	50, 51	sylib 218	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) We 𝐶)
53		fvex 6888	. . . . . . . . . . . . . 14 ⊢ (𝑊‘𝐵) ∈ V
54	53	cnvex 7919	. . . . . . . . . . . . 13 ⊢ ^◡(𝑊‘𝐵) ∈ V
55	54	imaex 7908	. . . . . . . . . . . 12 ⊢ (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) ∈ V
56	20, 55	eqeltri 2830	. . . . . . . . . . 11 ⊢ 𝐶 ∈ V
57	53	inex1 5287	. . . . . . . . . . 11 ⊢ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) ∈ V
58		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐶 ∧ 𝑟 = ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) → 𝑥 = 𝐶)
59	58	sseq1d 3990	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐶 ∧ 𝑟 = ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) → (𝑥 ⊆ 𝐴 ↔ 𝐶 ⊆ 𝐴))
60		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐶 ∧ 𝑟 = ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) → 𝑟 = ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)))
61	58	sqxpeqd 5686	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐶 ∧ 𝑟 = ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) → (𝑥 × 𝑥) = (𝐶 × 𝐶))
62	60, 61	sseq12d 3992	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐶 ∧ 𝑟 = ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) ⊆ (𝐶 × 𝐶)))
63	60, 58	weeq12d 5643	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐶 ∧ 𝑟 = ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) → (𝑟 We 𝑥 ↔ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) We 𝐶))
64	59, 62, 63	3anbi123d 1438	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝐶 ∧ 𝑟 = ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ↔ (𝐶 ⊆ 𝐴 ∧ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) ⊆ (𝐶 × 𝐶) ∧ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) We 𝐶)))
65	56, 57, 64	opelopaba 5511	. . . . . . . . . 10 ⊢ (⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)} ↔ (𝐶 ⊆ 𝐴 ∧ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) ⊆ (𝐶 × 𝐶) ∧ ((𝑊‘𝐵) ∩ (𝐶 × 𝐶)) We 𝐶))
66	44, 46, 52, 65	syl3anbrc 1344	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)})
67	66, 12	eleqtrrdi 2845	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩ ∈ 𝑂)
68	5, 43	ssexd 5294	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → 𝐵 ∈ V)
69	53	a1i 11	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝑊‘𝐵) ∈ V)
70		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = 𝐵 ∧ 𝑟 = (𝑊‘𝐵)) → 𝑥 = 𝐵)
71	70	sseq1d 3990	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐵 ∧ 𝑟 = (𝑊‘𝐵)) → (𝑥 ⊆ 𝐴 ↔ 𝐵 ⊆ 𝐴))
72		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = 𝐵 ∧ 𝑟 = (𝑊‘𝐵)) → 𝑟 = (𝑊‘𝐵))
73	70	sqxpeqd 5686	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = 𝐵 ∧ 𝑟 = (𝑊‘𝐵)) → (𝑥 × 𝑥) = (𝐵 × 𝐵))
74	72, 73	sseq12d 3992	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐵 ∧ 𝑟 = (𝑊‘𝐵)) → (𝑟 ⊆ (𝑥 × 𝑥) ↔ (𝑊‘𝐵) ⊆ (𝐵 × 𝐵)))
75	72, 70	weeq12d 5643	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐵 ∧ 𝑟 = (𝑊‘𝐵)) → (𝑟 We 𝑥 ↔ (𝑊‘𝐵) We 𝐵))
76	71, 74, 75	3anbi123d 1438	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐵 ∧ 𝑟 = (𝑊‘𝐵)) → ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ↔ (𝐵 ⊆ 𝐴 ∧ (𝑊‘𝐵) ⊆ (𝐵 × 𝐵) ∧ (𝑊‘𝐵) We 𝐵)))
77	76	opelopabga 5508	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ V ∧ (𝑊‘𝐵) ∈ V) → (⟨𝐵, (𝑊‘𝐵)⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)} ↔ (𝐵 ⊆ 𝐴 ∧ (𝑊‘𝐵) ⊆ (𝐵 × 𝐵) ∧ (𝑊‘𝐵) We 𝐵)))
78	68, 69, 77	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (⟨𝐵, (𝑊‘𝐵)⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)} ↔ (𝐵 ⊆ 𝐴 ∧ (𝑊‘𝐵) ⊆ (𝐵 × 𝐵) ∧ (𝑊‘𝐵) We 𝐵)))
79	43, 36, 48, 78	mpbir3and 1343	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ⟨𝐵, (𝑊‘𝐵)⟩ ∈ {⟨𝑥, 𝑟⟩ ∣ (𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥)})
80	79, 12	eleqtrrdi 2845	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ⟨𝐵, (𝑊‘𝐵)⟩ ∈ 𝑂)
81		f1fveq 7254	. . . . . . . 8 ⊢ ((𝐹:𝑂–1-1→𝐴 ∧ (⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩ ∈ 𝑂 ∧ ⟨𝐵, (𝑊‘𝐵)⟩ ∈ 𝑂)) → ((𝐹‘⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩) = (𝐹‘⟨𝐵, (𝑊‘𝐵)⟩) ↔ ⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩ = ⟨𝐵, (𝑊‘𝐵)⟩))
82	31, 67, 80, 81	syl12anc 836	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ((𝐹‘⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩) = (𝐹‘⟨𝐵, (𝑊‘𝐵)⟩) ↔ ⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩ = ⟨𝐵, (𝑊‘𝐵)⟩))
83	30, 82	mpbid 232	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩ = ⟨𝐵, (𝑊‘𝐵)⟩)
84	56, 57	opth1 5450	. . . . . 6 ⊢ (⟨𝐶, ((𝑊‘𝐵) ∩ (𝐶 × 𝐶))⟩ = ⟨𝐵, (𝑊‘𝐵)⟩ → 𝐶 = 𝐵)
85	83, 84	syl 17	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → 𝐶 = 𝐵)
86	19, 85	eleqtrrd 2837	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐵𝐹(𝑊‘𝐵)) ∈ 𝐶)
87	86, 20	eleqtrdi 2844	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐵𝐹(𝑊‘𝐵)) ∈ (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}))
88		ovex 7436	. . . . 5 ⊢ (𝐵𝐹(𝑊‘𝐵)) ∈ V
89	88	eliniseg 6081	. . . 4 ⊢ ((𝐵𝐹(𝑊‘𝐵)) ∈ 𝐵 → ((𝐵𝐹(𝑊‘𝐵)) ∈ (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) ↔ (𝐵𝐹(𝑊‘𝐵))(𝑊‘𝐵)(𝐵𝐹(𝑊‘𝐵))))
90	19, 89	syl 17	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ((𝐵𝐹(𝑊‘𝐵)) ∈ (^◡(𝑊‘𝐵) “ {(𝐵𝐹(𝑊‘𝐵))}) ↔ (𝐵𝐹(𝑊‘𝐵))(𝑊‘𝐵)(𝐵𝐹(𝑊‘𝐵))))
91	87, 90	mpbid 232	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝐵𝐹(𝑊‘𝐵))(𝑊‘𝐵)(𝐵𝐹(𝑊‘𝐵)))
92		weso 5645	. . . 4 ⊢ ((𝑊‘𝐵) We 𝐵 → (𝑊‘𝐵) Or 𝐵)
93	48, 92	syl 17	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → (𝑊‘𝐵) Or 𝐵)
94		sonr 5585	. . 3 ⊢ (((𝑊‘𝐵) Or 𝐵 ∧ (𝐵𝐹(𝑊‘𝐵)) ∈ 𝐵) → ¬ (𝐵𝐹(𝑊‘𝐵))(𝑊‘𝐵)(𝐵𝐹(𝑊‘𝐵)))
95	93, 19, 94	syl2anc 584	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝑂–1-1→𝐴) → ¬ (𝐵𝐹(𝑊‘𝐵))(𝑊‘𝐵)(𝐵𝐹(𝑊‘𝐵)))
96	91, 95	pm2.65da 816	1 ⊢ (𝐴 ∈ 𝑉 → ¬ 𝐹:𝑂–1-1→𝐴)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ∀wral 3051 Vcvv 3459 [wsbc 3765 ∩ cin 3925 ⊆ wss 3926 {csn 4601 ⟨cop 4607 ∪ cuni 4883 class class class wbr 5119 {copab 5181 Or wor 5560 We wwe 5605 × cxp 5652 ^◡ccnv 5653 dom cdm 5654 “ cima 5657 ⟶wf 6526 –1-1→wf1 6527 ‘cfv 6530 (class class class)co 7403

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7727

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-tp 4606 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6483 df-fun 6532 df-fn 6533 df-f 6534 df-f1 6535 df-fo 6536 df-f1o 6537 df-fv 6538 df-isom 6539 df-riota 7360 df-ov 7406 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8383 df-oi 9522

This theorem is referenced by: canthwe 10663

W3C validator