Theorem isomin 7334

Description: Isomorphisms preserve minimal elements. Note that (^◡𝑅 “ {𝐷}) is Takeuti and Zaring's idiom for the initial segment {𝑥 ∣ 𝑥𝑅𝐷}. Proposition 6.31(1) of [TakeutiZaring] p. 33. (Contributed by NM, 19-Apr-2004.)

Assertion

Ref	Expression
isomin	⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ ↔ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))

Proof of Theorem isomin

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

Step	Hyp	Ref	Expression
1		neq0 4346	. . . 4 ⊢ (¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅ ↔ ∃𝑦 𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})))
2		vex 3479	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
3	2	elima 6065	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝐻 “ 𝐶) ↔ ∃𝑥 ∈ 𝐶 𝑥𝐻𝑦)
4		ssel 3976	. . . . . . . . . . . . . 14 ⊢ (𝐶 ⊆ 𝐴 → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴))
5		isof1o 7320	. . . . . . . . . . . . . . 15 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻:𝐴–1-1-onto→𝐵)
6		f1ofn 6835	. . . . . . . . . . . . . . 15 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → 𝐻 Fn 𝐴)
7		fnbrfvb 6945	. . . . . . . . . . . . . . . 16 ⊢ ((𝐻 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦))
8	7	ex 414	. . . . . . . . . . . . . . 15 ⊢ (𝐻 Fn 𝐴 → (𝑥 ∈ 𝐴 → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦)))
9	5, 6, 8	3syl 18	. . . . . . . . . . . . . 14 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑥 ∈ 𝐴 → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦)))
10	4, 9	syl9r 78	. . . . . . . . . . . . 13 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝑥 ∈ 𝐶 → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦))))
11	10	imp31 419	. . . . . . . . . . . 12 ⊢ (((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) ∧ 𝑥 ∈ 𝐶) → ((𝐻‘𝑥) = 𝑦 ↔ 𝑥𝐻𝑦))
12	11	rexbidva 3177	. . . . . . . . . . 11 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → (∃𝑥 ∈ 𝐶 (𝐻‘𝑥) = 𝑦 ↔ ∃𝑥 ∈ 𝐶 𝑥𝐻𝑦))
13	3, 12	bitr4id 290	. . . . . . . . . 10 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → (𝑦 ∈ (𝐻 “ 𝐶) ↔ ∃𝑥 ∈ 𝐶 (𝐻‘𝑥) = 𝑦))
14		fvex 6905	. . . . . . . . . . 11 ⊢ (𝐻‘𝐷) ∈ V
15	2	eliniseg 6094	. . . . . . . . . . 11 ⊢ ((𝐻‘𝐷) ∈ V → (𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ 𝑦𝑆(𝐻‘𝐷)))
16	14, 15	mp1i 13	. . . . . . . . . 10 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → (𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ 𝑦𝑆(𝐻‘𝐷)))
17	13, 16	anbi12d 632	. . . . . . . . 9 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → ((𝑦 ∈ (𝐻 “ 𝐶) ∧ 𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ (∃𝑥 ∈ 𝐶 (𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
18		elin 3965	. . . . . . . . 9 ⊢ (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ (𝑦 ∈ (𝐻 “ 𝐶) ∧ 𝑦 ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
19		r19.41v 3189	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝐶 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) ↔ (∃𝑥 ∈ 𝐶 (𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)))
20	17, 18, 19	3bitr4g 314	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ 𝐶 ⊆ 𝐴) → (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ ∃𝑥 ∈ 𝐶 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
21	20	adantrr 716	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ ∃𝑥 ∈ 𝐶 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷))))
22		breq1 5152	. . . . . . . . . . . . . 14 ⊢ ((𝐻‘𝑥) = 𝑦 → ((𝐻‘𝑥)𝑆(𝐻‘𝐷) ↔ 𝑦𝑆(𝐻‘𝐷)))
23	22	biimpar 479	. . . . . . . . . . . . 13 ⊢ (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → (𝐻‘𝑥)𝑆(𝐻‘𝐷))
24		vex 3479	. . . . . . . . . . . . . . . 16 ⊢ 𝑥 ∈ V
25	24	eliniseg 6094	. . . . . . . . . . . . . . 15 ⊢ (𝐷 ∈ 𝐴 → (𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ 𝑥𝑅𝐷))
26	25	ad2antll 728	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ 𝑥𝑅𝐷))
27		isorel 7323	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥𝑅𝐷 ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
28	26, 27	bitrd 279	. . . . . . . . . . . . 13 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
29	23, 28	imbitrrid 245	. . . . . . . . . . . 12 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷})))
30	29	exp32 422	. . . . . . . . . . 11 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑥 ∈ 𝐴 → (𝐷 ∈ 𝐴 → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷})))))
31	4, 30	syl9r 78	. . . . . . . . . 10 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝑥 ∈ 𝐶 → (𝐷 ∈ 𝐴 → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷}))))))
32	31	com34 91	. . . . . . . . 9 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝐷 ∈ 𝐴 → (𝑥 ∈ 𝐶 → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷}))))))
33	32	imp32 420	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ 𝐶 → (((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → 𝑥 ∈ (◡𝑅 “ {𝐷}))))
34	33	reximdvai 3166	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∃𝑥 ∈ 𝐶 ((𝐻‘𝑥) = 𝑦 ∧ 𝑦𝑆(𝐻‘𝐷)) → ∃𝑥 ∈ 𝐶 𝑥 ∈ (◡𝑅 “ {𝐷})))
35	21, 34	sylbid 239	. . . . . 6 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) → ∃𝑥 ∈ 𝐶 𝑥 ∈ (◡𝑅 “ {𝐷})))
36		elin 3965	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) ↔ (𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})))
37	36	exbii 1851	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) ↔ ∃𝑥(𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})))
38		neq0 4346	. . . . . . 7 ⊢ (¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ ↔ ∃𝑥 𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})))
39		df-rex 3072	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝐶 𝑥 ∈ (◡𝑅 “ {𝐷}) ↔ ∃𝑥(𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})))
40	37, 38, 39	3bitr4i 303	. . . . . 6 ⊢ (¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ ↔ ∃𝑥 ∈ 𝐶 𝑥 ∈ (◡𝑅 “ {𝐷}))
41	35, 40	imbitrrdi 251	. . . . 5 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) → ¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅))
42	41	exlimdv 1937	. . . 4 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∃𝑦 𝑦 ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) → ¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅))
43	1, 42	biimtrid 241	. . 3 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅ → ¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅))
44	43	con4d 115	. 2 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ → ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))
45	5, 6	syl 17	. . . . . . . . 9 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → 𝐻 Fn 𝐴)
46		fnfvima 7235	. . . . . . . . . . 11 ⊢ ((𝐻 Fn 𝐴 ∧ 𝐶 ⊆ 𝐴 ∧ 𝑥 ∈ 𝐶) → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶))
47	46	3expia 1122	. . . . . . . . . 10 ⊢ ((𝐻 Fn 𝐴 ∧ 𝐶 ⊆ 𝐴) → (𝑥 ∈ 𝐶 → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶)))
48	47	adantrr 716	. . . . . . . . 9 ⊢ ((𝐻 Fn 𝐴 ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ 𝐶 → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶)))
49	45, 48	sylan 581	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ 𝐶 → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶)))
50	49	adantrd 493	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})) → (𝐻‘𝑥) ∈ (𝐻 “ 𝐶)))
51	27	biimpd 228	. . . . . . . . . . . . . 14 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥𝑅𝐷 → (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
52		fvex 6905	. . . . . . . . . . . . . . . 16 ⊢ (𝐻‘𝑥) ∈ V
53	52	eliniseg 6094	. . . . . . . . . . . . . . 15 ⊢ ((𝐻‘𝐷) ∈ V → ((𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷)))
54	14, 53	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}) ↔ (𝐻‘𝑥)𝑆(𝐻‘𝐷))
55	51, 54	imbitrrdi 251	. . . . . . . . . . . . 13 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥𝑅𝐷 → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
56	26, 55	sylbid 239	. . . . . . . . . . . 12 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
57	56	exp32 422	. . . . . . . . . . 11 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝑥 ∈ 𝐴 → (𝐷 ∈ 𝐴 → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))))
58	4, 57	syl9r 78	. . . . . . . . . 10 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝑥 ∈ 𝐶 → (𝐷 ∈ 𝐴 → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}))))))
59	58	com34 91	. . . . . . . . 9 ⊢ (𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) → (𝐶 ⊆ 𝐴 → (𝐷 ∈ 𝐴 → (𝑥 ∈ 𝐶 → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}))))))
60	59	imp32 420	. . . . . . . 8 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ 𝐶 → (𝑥 ∈ (◡𝑅 “ {𝐷}) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}))))
61	60	impd 412	. . . . . . 7 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})) → (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
62	50, 61	jcad 514	. . . . . 6 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝑥 ∈ 𝐶 ∧ 𝑥 ∈ (◡𝑅 “ {𝐷})) → ((𝐻‘𝑥) ∈ (𝐻 “ 𝐶) ∧ (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)}))))
63		elin 3965	. . . . . 6 ⊢ ((𝐻‘𝑥) ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) ↔ ((𝐻‘𝑥) ∈ (𝐻 “ 𝐶) ∧ (𝐻‘𝑥) ∈ (◡𝑆 “ {(𝐻‘𝐷)})))
64	62, 36, 63	3imtr4g 296	. . . . 5 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) → (𝐻‘𝑥) ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)}))))
65		n0i 4334	. . . . 5 ⊢ ((𝐻‘𝑥) ∈ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) → ¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅)
66	64, 65	syl6 35	. . . 4 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) → ¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))
67	66	exlimdv 1937	. . 3 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∃𝑥 𝑥 ∈ (𝐶 ∩ (◡𝑅 “ {𝐷})) → ¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))
68	38, 67	biimtrid 241	. 2 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (¬ (𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ → ¬ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))
69	44, 68	impcon4bid 226	1 ⊢ ((𝐻 Isom 𝑅, 𝑆 (𝐴, 𝐵) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((𝐶 ∩ (◡𝑅 “ {𝐷})) = ∅ ↔ ((𝐻 “ 𝐶) ∩ (◡𝑆 “ {(𝐻‘𝐷)})) = ∅))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1542  ∃wex 1782   ∈ wcel 2107  ∃wrex 3071  Vcvv 3475   ∩ cin 3948   ⊆ wss 3949  ∅c0 4323  {csn 4629   class class class wbr 5149  ^◡ccnv 5676   “ cima 5680   Fn wfn 6539  –1-1-onto→wf1o 6543  ‘cfv 6544   Isom wiso 6545

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-f1o 6551  df-fv 6552  df-isom 6553

This theorem is referenced by:  isofrlem  7337