Theorem reuf1odnf 47217

Description: There is exactly one element in each of two isomorphic sets. Variant of reuf1od 47218 with no distinct variable condition for 𝜒. (Contributed by AV, 19-Mar-2023.)

Hypotheses

Ref	Expression
reuf1odnf.f	⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐵)
reuf1odnf.x	⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ 𝜒))
reuf1odnf.z	⊢ (𝑥 = 𝑧 → (𝜓 ↔ 𝜃))
reuf1odnf.n	⊢ Ⅎ𝑥𝜒

Assertion

Ref	Expression
reuf1odnf	⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐹,𝑦   𝜑,𝑥,𝑦   𝜓,𝑦   𝜓,𝑧   𝜃,𝑥   𝑥,𝑧

Allowed substitution hints:   𝜑(𝑧)   𝜓(𝑥)   𝜒(𝑥,𝑦,𝑧)   𝜃(𝑦,𝑧)   𝐵(𝑧)   𝐶(𝑧)   𝐹(𝑧)

Proof of Theorem reuf1odnf

Step	Hyp	Ref	Expression
1		reuf1odnf.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝐶–1-1-onto→𝐵)
2		f1of 6763	. . . . 5 ⊢ (𝐹:𝐶–1-1-onto→𝐵 → 𝐹:𝐶⟶𝐵)
3	1, 2	syl 17	. . . 4 ⊢ (𝜑 → 𝐹:𝐶⟶𝐵)
4	3	ffvelcdmda 7017	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → (𝐹‘𝑦) ∈ 𝐵)
5		f1ofveu 7340	. . . . 5 ⊢ ((𝐹:𝐶–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 (𝐹‘𝑦) = 𝑥)
6		eqcom 2738	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑦) ↔ (𝐹‘𝑦) = 𝑥)
7	6	reubii 3355	. . . . 5 ⊢ (∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦) ↔ ∃!𝑦 ∈ 𝐶 (𝐹‘𝑦) = 𝑥)
8	5, 7	sylibr 234	. . . 4 ⊢ ((𝐹:𝐶–1-1-onto→𝐵 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦))
9	1, 8	sylan 580	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃!𝑦 ∈ 𝐶 𝑥 = (𝐹‘𝑦))
10		sbceq1a 3747	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑦) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑥]𝜓))
11	10	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑥]𝜓))
12		reuf1odnf.z	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝜓 ↔ 𝜃))
13	12	cbvsbcvw 3770	. . . 4 ⊢ ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃)
14	11, 13	bitrdi 287	. . 3 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃))
15	4, 9, 14	reuxfr1d 3704	. 2 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑧]𝜃))
16	13	a1i 11	. . . 4 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ [(𝐹‘𝑦) / 𝑧]𝜃))
17	16	bicomd 223	. . 3 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑧]𝜃 ↔ [(𝐹‘𝑦) / 𝑥]𝜓))
18	17	reubidv 3362	. 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑧]𝜃 ↔ ∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑥]𝜓))
19		fvexd 6837	. . . 4 ⊢ (𝜑 → (𝐹‘𝑦) ∈ V)
20		reuf1odnf.x	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = (𝐹‘𝑦)) → (𝜓 ↔ 𝜒))
21		nfv 1915	. . . 4 ⊢ Ⅎ𝑥𝜑
22		reuf1odnf.n	. . . . 5 ⊢ Ⅎ𝑥𝜒
23	22	a1i 11	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝜒)
24	19, 20, 21, 23	sbciedf 3779	. . 3 ⊢ (𝜑 → ([(𝐹‘𝑦) / 𝑥]𝜓 ↔ 𝜒))
25	24	reubidv 3362	. 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝐶 [(𝐹‘𝑦) / 𝑥]𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))
26	15, 18, 25	3bitrd 305	1 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑦 ∈ 𝐶 𝜒))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541  Ⅎwnf 1784   ∈ wcel 2111  ∃!wreu 3344  Vcvv 3436  [wsbc 3736  ⟶wf 6477  –1-1-onto→wf1o 6480  ‘cfv 6481

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 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489

This theorem is referenced by:  prproropreud  47619