Theorem oemapval 9662

Description: Value of the relation 𝑇. (Contributed by Mario Carneiro, 28-May-2015.)

Hypotheses

Ref	Expression
cantnfs.s	⊢ 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a	⊢ (𝜑 → 𝐴 ∈ On)
cantnfs.b	⊢ (𝜑 → 𝐵 ∈ On)
oemapval.t	⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
oemapval.f	⊢ (𝜑 → 𝐹 ∈ 𝑆)
oemapval.g	⊢ (𝜑 → 𝐺 ∈ 𝑆)

Assertion

Ref	Expression
oemapval	⊢ (𝜑 → (𝐹𝑇𝐺 ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))))

Distinct variable groups:   𝑥,𝑤,𝑦,𝑧,𝐵   𝑤,𝐴,𝑥,𝑦,𝑧   𝑤,𝐹,𝑥,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑤,𝐺,𝑥,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑤)   𝑆(𝑤)   𝑇(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem oemapval

Step	Hyp	Ref	Expression
1		oemapval.f	. 2 ⊢ (𝜑 → 𝐹 ∈ 𝑆)
2		oemapval.g	. 2 ⊢ (𝜑 → 𝐺 ∈ 𝑆)
3		fveq1 6887	. . . . . 6 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑧) = (𝐹‘𝑧))
4		fveq1 6887	. . . . . 6 ⊢ (𝑦 = 𝐺 → (𝑦‘𝑧) = (𝐺‘𝑧))
5		eleq12 2856	. . . . . 6 ⊢ (((𝑥‘𝑧) = (𝐹‘𝑧) ∧ (𝑦‘𝑧) = (𝐺‘𝑧)) → ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ↔ (𝐹‘𝑧) ∈ (𝐺‘𝑧)))
6	3, 4, 5	syl2an 608	. . . . 5 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ↔ (𝐹‘𝑧) ∈ (𝐺‘𝑧)))
7		fveq1 6887	. . . . . . . 8 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑤) = (𝐹‘𝑤))
8		fveq1 6887	. . . . . . . 8 ⊢ (𝑦 = 𝐺 → (𝑦‘𝑤) = (𝐺‘𝑤))
9	7, 8	eqeqan12d 2780	. . . . . . 7 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑥‘𝑤) = (𝑦‘𝑤) ↔ (𝐹‘𝑤) = (𝐺‘𝑤)))
10	9	imbi2d 343	. . . . . 6 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → ((𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))
11	10	ralbidv 3191	. . . . 5 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))
12	6, 11	anbi12d 644	. . . 4 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))))
13	12	rexbidv 3192	. . 3 ⊢ ((𝑥 = 𝐹 ∧ 𝑦 = 𝐺) → (∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))))
14		oemapval.t	. . 3 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
15	13, 14	brabga 5523	. 2 ⊢ ((𝐹 ∈ 𝑆 ∧ 𝐺 ∈ 𝑆) → (𝐹𝑇𝐺 ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))))
16	1, 2, 15	syl2anc 596	1 ⊢ (𝜑 → (𝐹𝑇𝐺 ↔ ∃𝑧 ∈ 𝐵 ((𝐹‘𝑧) ∈ (𝐺‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3082  ∃wrex 3092   class class class wbr 5114  {copab 5178  dom cdm 5666  Oncon0 6367  ‘cfv 6543  (class class class)co 7423   CNF ccnf 9640

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-iota 6499  df-fv 6551

This theorem is used by:  oemapvali  9663